
<!DOCTYPE html>
<html>

	<head>
	<title>CAIJL's Blog</title>
	<meta charset="utf-8"/>
	<link rel="stylesheet" href="/font-awesome-4.7.0/css/font-awesome.min.css">

	<link rel="stylesheet" href="/bootstrap-3.3.7/css/bootstrap.min.css">
	<script src="/jquery-2.1.1/jquery.min.js"></script>
	<script src="/bootstrap-3.3.7/js/bootstrap.min.js"></script>

	<link rel="stylesheet" href="/css/bootstrap-slider.min.css">
	<script src="/js/bootstrap-slider.min.js"></script>
	
	<link rel="stylesheet" href="/css/main.css">
	<script src="/js/main.js"></script>
	
	<link rel="stylesheet" href="/css/cursor.css">
	<script src="/js/cursor.js"></script>
	
	
	<link rel="stylesheet" href="/css/code.css">
	<!--link rel="stylesheet" href="/css/markdown.css"-->
	
	<link rel="stylesheet" href="/css/head.css">

	<script src="/js/window.js"></script>
	<script src='//unpkg.com/valine/dist/Valine.min.js'></script>
	</head>
<body>

	<link rel="stylesheet" href="/katex/katex.min.css" crossorigin="anonymous">
	<script src="/katex/katex.min.js" crossorigin="anonymous"></script>
	<script src="/katex/contrib/mathtex-script-type.min.js" defer></script>
	<script defer src="/katex/contrib/auto-render.min.js"crossorigin="anonymous"
	    onload="renderMathInElement(document.body);"></script>
	<script>document.addEventListener("DOMContentLoaded", function() {renderMathInElement(document.body,{"delimiters":[{left: "$", right: "$", display: false}]});});</script>
	<nav class="navbar navbar-default header card" role="navigation" style="width: 100%;">
	<div class="container-fluid"> 
	<div class="navbar-header">
		<button type="button" class="navbar-toggle" data-toggle="collapse"
				data-target="#example-navbar-collapse">
			<span class="icon-bar"></span>
			<span class="icon-bar"></span>
			<span class="icon-bar"></span>
		</button>
		<a class="navbar-brand" href="/"><span><span class="katex"><span class="katex-mathml"><math xmlns="http://www.w3.org/1998/Math/MathML"><semantics><mrow><mi mathvariant="bold">C</mi><mi mathvariant="bold">A</mi><mi mathvariant="bold">I</mi><mi mathvariant="bold">J</mi><msup><mi mathvariant="bold">L</mi><mo mathvariant="bold" lspace="0em" rspace="0em">′</mo></msup><mi mathvariant="bold">s</mi><mi mathvariant="bold">B</mi><mi mathvariant="bold">L</mi><mi mathvariant="bold">O</mi><mi mathvariant="bold">G</mi></mrow><annotation encoding="application/x-tex">\mathbf{CAIJL'sBLOG}</annotation></semantics></math></span><span class="katex-html" aria-hidden="true"><span class="base"><span class="strut" style="height: 0.751892em; vertical-align: 0em;"></span><span class="mord"><span class="mord mathbf">C</span><span class="mord mathbf">A</span><span class="mord mathbf">I</span><span class="mord mathbf">J</span><span class="mord"><span class="mord mathbf">L</span><span class="msupsub"><span class="vlist-t"><span class="vlist-r"><span class="vlist" style="height: 0.751892em;"><span class="" style="top: -3.063em; margin-right: 0.05em;"><span class="pstrut" style="height: 2.7em;"></span><span class="sizing reset-size6 size3 mtight"><span class="mord mtight"><span class="mord mathbf mtight">′</span></span></span></span></span></span></span></span></span><span class="mord mathbf">s</span><span class="mord mathbf">B</span><span class="mord mathbf">L</span><span class="mord mathbf">O</span><span class="mord mathbf">G</span></span></span></span></span></span></a>
	</div>
	<div class="collapse navbar-collapse" id="example-navbar-collapse">
		<ul class="nav navbar-nav" style="background-color:#fcfcfc">
			<li><a href="/"><i class="menu-item-icon fa fa-fw fa-home"></i>首页</a></li>
			<li><a href="/archives/"><i class="menu-item-icon fa fa-fw fa-archive"></i>文章</a></li>
			<li><a href="/tags/"><i class="menu-item-icon fa fa-fw fa-tags"></i>标签</a></li>
			<li><a href="/settings/"><i class="menu-item-icon fa fa-fw fa-cogs"></i>设置</a></li>
			<!--li><a href="/about/"><i class="menu-item-icon fa fa-fw fa-user"></i>关于</a></li-->
			<li><a href="/games/"><i class="menu-item-icon fa fa-fw fa-gamepad"></i>其它</a></li>
			

		</ul>
	</div>
	</div>
	</nav>
<div class="container">
	<div style="height: 60px;"></div>
	<div class="row" >
		<div class="col-md-8">
			<div class="panel panel-default card" style="padding: 10px;position: relative;">
                <img src='/img/bg/9.png' style="width:100%"/>
				<span style="position: absolute;left:15px;bottom:15px;width:90%;"><font class="view-text" style="color:#fcfcfc;font-size:25px">题解 CF1349F2 【Slime and Sequences (Hard Version)】</font><br><a href="/tags/2021/" class="tag"><span  style="background-color: rgb(52, 152, 219);">2021</span></a>&nbsp;<a href="/tags/二项式反演/" class="tag"><span  style="background-color: rgb(231, 76, 60);">二项式反演</span></a>&nbsp;<a href="/tags/拉格朗日反演/" class="tag"><span  style="background-color: rgb(231, 76, 60);">拉格朗日反演</span></a>&nbsp;<a href="/tags/生成函数/" class="tag"><span  style="background-color: rgb(231, 76, 60);">生成函数</span></a>&nbsp;<a href="/tags/题解/" class="tag"><span  style="background-color: rgb(82, 196, 26);">题解</span></a></span>
			</div>
			<div class="panel panel-default card" style="padding: 10px;" id="main">
                <h2 id="_1">题意</h2>
<p>对于正整数序列 <script type="math/tex">p</script>，定义 <script type="math/tex">p</script> 是好的，当且仅当如果 <script type="math/tex">k</script> 在 <script type="math/tex">p</script> 中出现过，那么在 <script type="math/tex">k</script> 的最后一次出现之前，有 <script type="math/tex">k-1</script> 出现过。</p>
<p>设所有长度为 <script type="math/tex">n</script> 的好的序列组成的集合为 <script type="math/tex">S_n</script>。对于序列 <script type="math/tex">p</script> 和正整数 <script type="math/tex">i</script> 定义 <script type="math/tex">f_p(i)</script> 为 <script type="math/tex">i</script> 在 <script type="math/tex">p</script> 中出现的次数。现在请你对于所有 <script type="math/tex">i \in [1,n]</script>，求出</p>
<p>
<script type="math/tex; mode=display">\sum_{p \in S_n} f_p(i)</script>
</p>
<h2 id="_2">题解</h2>
<p>把序列把 <script type="math/tex">1</script> 的位置倒着输出，再把 <script type="math/tex">2</script> 的位置倒着输出，会形成一个长度为 <script type="math/tex">n</script> 的排列。</p>
<p>由题意得到，<script type="math/tex">1</script> 的第一个在 <script type="math/tex">2</script> 的最后一个之前，会形成一个上升。</p>
<p>上升的个数 <script type="math/tex">+1</script> 就是最大的数字。是一个双射。</p>
<p>于是得到了一个神秘的柿子：
<script type="math/tex; mode=display">ans_{k}=\sum_{i=\max(1,k)}^n\left\langle\begin{matrix}i\\k\end{matrix}\right\rangle\binom ni(n-i)!</script>
</p>
<p>
<script type="math/tex">\rm\color{black}K\color{red}als</script> 给这个写了一个详细的证明，这里就直接感性理解了。可以理解为 <script type="math/tex">\text{选i个}\times \text{前i个有k个上升}\times\text{剩下放任自流}</script>。因此如果一个序列若第 <script type="math/tex">k+1</script> 段有 <script type="math/tex">x</script> 个，就会计算 <script type="math/tex">x</script> 次。因此这个柿子是和题意中的式子是等价的。</p>
<p>不管 <script type="math/tex">k=0</script> 可以认为下界就是 <script type="math/tex">k</script>
</p>
<p>由<a href="ji-lei-shu.html">这个</a>可以得到欧拉数另一种表达式：
<script type="math/tex; mode=display">\left\langle\begin{matrix}n\\k\end{matrix}\right\rangle=n!\sum_{j=k}^n\binom jk(-1)^{j-k}[x^n](e^x-1)^{n-j}</script>
</p>
<p>暴力带进去得到：
<script type="math/tex; mode=display">
\begin{aligned}
ans_k&=\sum_{i=k}^n\binom ni (n-i)!i!\sum_{j=k}^i\binom jk(-1)^{j-k}[x^i](e^x-1)^{i-j}\\
&=n!\sum_{i=k}^n\sum_{j=k}^i\frac {j!}{k!(j-k)!} (-1)^{j-k}[x^i](e^x-1)^{i-j}\\
&=\frac{n!}{k!}\sum_{j=k}^nj!\left(\sum_{i=j}^n[x^i](e^x-1)^{i-j}\right) \frac{(-1)^{j-k}}{(j-k)!}
\end{aligned}
</script>
这个形式已经可以差卷积了，我们设 <script type="math/tex">f_j=\sum_{i=j}^n[x^i](e^x-1)^{i-j}</script>，就会有：
<script type="math/tex; mode=display">=\frac{n!}{k!}\sum_{j=k}^nj!f_j\times \frac{(-1)^{j-k}}{(j-k)!}</script>
</p>
<p>如果设 <script type="math/tex">a_{n-j-1}=j!f_j,b_j=\frac{(-1)^j}{j!}</script>，有：
<script type="math/tex; mode=display">=\frac{n!}{k!}\sum_{j=k}^na_{n-j-1}b_{j-k}</script>
于是问题变成 <script type="math/tex">f_j</script>。</p>
<p>先简单推导：</p>
<p>
<script type="math/tex; mode=display">\begin{aligned}
f_j&=\sum_{i=j}^n[x^i](e^x-1)^{i-j}\\
&=\sum_{i=j}^n[x^{i-i+j}]\left(\frac{e^x-1}x\right)^{i-j}\\
&=[x^j]\sum_{i=j}^n\left(\frac{e^x-1}x\right)^{i-j}\\
&=[x^j]\frac{1-\left(\frac{e^x-1}x\right)^{n-j+1}}{1-\left(\frac{e^x-1}x\right)}
\end{aligned}</script>
不妨设 <script type="math/tex">F(x)=\frac{e^x-1}x</script>
<script type="math/tex; mode=display">
\begin{aligned}
&=[x^j]\frac{1-F(x)^{n-j+1}}{1-F(x)}\\
&=[x^j]\frac1{1-F(x)}-[x^j]\frac{F(x)^{n-j+1}}{1-F(x)}
\end{aligned}
</script>
第一部分不难发现是有逆的，虽然整式域下没有，但扩展到分式域就存在，可以比较简单地求出。</p>
<p>
<script type="math/tex; mode=display">[x^j]\frac1{1-F(x)}=[x^j]\left(\frac1{(1-F(x))/x}\right)x^{-1}=[x^{j+1}]\left(\frac1{(1-F(x))/x}\right)</script>
</p>
<p><del>然后第二部分就不会了QwQ</del> </p>
<p>加入一个元来区分信息，然后各种神仙操作 <del>以及Dirty Work</del></p>
<p>首先把那一坨提取的系数固定
<script type="math/tex; mode=display">
\begin{aligned}
[x^j]\frac{F(x)^{n-j+1}}{1-F(x)}&=[x^{j+n-j+1}]\frac{(xF(x))^{n-j+1}}{1-F(x)}\\
&=[x^{n+1}]\frac{(xF(x))^{n-j+1}}{1-F(x)}
\end{aligned}
</script>
然后添加元 <script type="math/tex">y</script>
<script type="math/tex; mode=display">
\begin{aligned}
f_j&=[x^{n+1}y^{n-j+1}]\sum_{i=0}\frac{(xF(x)y)^i}{1-F(x)}\\
&=[x^{n+1}y^{n-j+1}]\frac1{1-F(x)}\times \frac1{1-xF(x)y}
\end{aligned}
</script>
如果使用复合那一套，<script type="math/tex">xF(x)</script> 这样的形式是我们不喜欢的，因此令 <script type="math/tex">W(x)=xF(x)=e^x-1</script>，<script type="math/tex">H(W(x))=F(x)</script>，于是就会出现一些神奇的现象：
<script type="math/tex; mode=display">\begin{aligned}
xF(x)&=xH(W(x))\\
\frac{W(x)}{H(W(x))}&=x
\end{aligned}</script>
</p>
<p>如果设 <script type="math/tex">G(x)=\frac1{1-H(x)}\times\frac1{1-xy}</script>，就会有：
<script type="math/tex; mode=display">G(W(x))=\frac1{1-F(x)}\times \frac1{1-xF(x)y}</script>
</p>
<p>这个形式就可以上扩展拉格朗日反演了。不难发现 <script type="math/tex">W(x)</script> 的复合逆 <script type="math/tex">P(x)</script> 为 <script type="math/tex">\ln(x+1)</script>，而且 <script type="math/tex">P(W(x))=\frac{W(x)}{H(W(x))}</script>，用 <script type="math/tex">x</script> 代替 <script type="math/tex">W(x)</script> 得到 <script type="math/tex">P(x)=\dfrac x{H(x)}</script>
</p>
<p>于是上拉反，得到 <script type="math/tex">[x^{n+1}]</script> 的关于 <script type="math/tex">y</script> 的多项式：
<script type="math/tex; mode=display">
\begin{aligned}
&[x^{n+1}]G(W(x))\\
=&\frac1{n+1}[x^n]G^\prime(x)\times \left(\frac x{P(x)}\right)^{n+1}\\
=&\frac1{n+1}[x^n]G^\prime(x)\times H(x)^{n+1}\\
=&\frac1{n+1}[x^n]\left(\frac y{(1-xy)^2(1-H(x))}
+\frac{H^\prime(x)}{(1-xy)(1-H(x))^2}\right)H(x)^{n+1}
\end{aligned}
</script>
别问我那一串怎么导 <del>我总不能说自己去下mathematica吧</del></p>
<p>现在局势似乎明朗了起来，这样的形式明显可以写成幂级数
<script type="math/tex; mode=display">
=\frac1{n+1}[x^n]\left(\frac{H(x)^{n+1}}{1-H(x)}\sum_{i=0}(i+1)x^iy^{i+1}+\frac{H^\prime(x)H(x)^{n+1}}{(1-H(x))^2}\sum_{i=0}x^iy^i\right)
</script>
假设我们现在要提取 <script type="math/tex">y</script> 的第 <script type="math/tex">m</script>项</p>
<p>
<script type="math/tex; mode=display">\begin{aligned}
&\frac1{n+1}[x^n]\left(\frac{H(x)^{n+1}}{1-H(x)} mx^{m-1}+\frac{H^\prime(x)H(x)^{n+1}}{(1-H(x))^2}x^m\right)\\
&\frac1{n+1}\left([x^{n-m+1}]\frac{mH(x)^{n+1}}{1-H(x)}+[x^{n-m}]\frac{H^\prime(x)H(x)^{n+1}}{(1-H(x))^2}\right)\\
&\frac1{n+1}\left(m[x^{n-m+2}]\frac{H(x)^{n+1}}{(1-H(x))/x}+[x^{n-m+2}]\frac{H^\prime(x)H(x)^{n+1}}{(1-H(x))^2/x^2}\right)
\end{aligned}
</script>
</p>
<h2 id="_3">代码</h2>
<p>卡着时限过的，被卡常了/kk
<div class="highlight"><pre><span></span><code><span class="linenos" data-linenos="  1 "></span><span class="cp">#pragma GCC optimize(&quot;Ofast&quot;)</span>
<span class="linenos" data-linenos="  2 "></span><span class="cp">#include</span><span class="cpf">&lt;bits/stdc++.h&gt;</span><span class="cp"></span>
<span class="linenos" data-linenos="  3 "></span><span class="k">namespace</span> <span class="n">in</span><span class="p">{</span>
<span class="linenos" data-linenos="  4 "></span>    <span class="cp">#ifndef slow</span>
<span class="linenos" data-linenos="  5 "></span>    <span class="kt">char</span> <span class="n">buf</span><span class="p">[</span><span class="mi">1</span><span class="o">&lt;&lt;</span><span class="mi">21</span><span class="p">],</span><span class="o">*</span><span class="n">p1</span><span class="o">=</span><span class="n">buf</span><span class="p">,</span><span class="o">*</span><span class="n">p2</span><span class="o">=</span><span class="n">buf</span><span class="p">;</span>
<span class="linenos" data-linenos="  6 "></span>    <span class="kr">inline</span> <span class="kt">int</span> <span class="n">getc</span><span class="p">(){</span><span class="k">return</span> <span class="n">p1</span><span class="o">==</span><span class="n">p2</span><span class="o">&amp;&amp;</span><span class="p">(</span><span class="n">p2</span><span class="o">=</span><span class="p">(</span><span class="n">p1</span><span class="o">=</span><span class="n">buf</span><span class="p">)</span><span class="o">+</span><span class="n">fread</span><span class="p">(</span><span class="n">buf</span><span class="p">,</span><span class="mi">1</span><span class="p">,</span><span class="mi">1</span><span class="o">&lt;&lt;</span><span class="mi">21</span><span class="p">,</span><span class="n">stdin</span><span class="p">),</span><span class="n">p1</span><span class="o">==</span><span class="n">p2</span><span class="p">)</span><span class="o">?</span><span class="nl">EOF</span><span class="p">:</span><span class="o">*</span><span class="n">p1</span><span class="o">++</span><span class="p">;}</span>
<span class="linenos" data-linenos="  7 "></span>    <span class="cp">#else</span>
<span class="linenos" data-linenos="  8 "></span>    <span class="kr">inline</span> <span class="kt">int</span> <span class="n">getc</span><span class="p">(){</span><span class="k">return</span> <span class="nf">getchar</span><span class="p">();}</span>
<span class="linenos" data-linenos="  9 "></span>    <span class="cp">#endif</span>
<span class="linenos" data-linenos=" 10 "></span>    <span class="k">template</span> <span class="o">&lt;</span><span class="k">typename</span> <span class="nc">T</span><span class="o">&gt;</span><span class="kr">inline</span> <span class="kt">void</span> <span class="n">read</span><span class="p">(</span><span class="n">T</span><span class="o">&amp;</span> <span class="n">t</span><span class="p">){</span>
<span class="linenos" data-linenos=" 11 "></span>        <span class="n">t</span><span class="o">=</span><span class="mi">0</span><span class="p">;</span><span class="kt">int</span> <span class="n">f</span><span class="o">=</span><span class="mi">0</span><span class="p">;</span><span class="kt">char</span> <span class="n">ch</span><span class="o">=</span><span class="n">getc</span><span class="p">();</span><span class="k">while</span> <span class="p">(</span><span class="o">!</span><span class="n">isdigit</span><span class="p">(</span><span class="n">ch</span><span class="p">)){</span><span class="k">if</span><span class="p">(</span><span class="n">ch</span><span class="o">==</span><span class="sc">&#39;-&#39;</span><span class="p">)</span><span class="n">f</span> <span class="o">=</span> <span class="mi">1</span><span class="p">;</span><span class="n">ch</span><span class="o">=</span><span class="n">getc</span><span class="p">();}</span>
<span class="linenos" data-linenos=" 12 "></span>        <span class="k">while</span><span class="p">(</span><span class="n">isdigit</span><span class="p">(</span><span class="n">ch</span><span class="p">)){</span><span class="n">t</span><span class="o">=</span><span class="n">t</span><span class="o">*</span><span class="mi">10</span><span class="o">+</span><span class="n">ch</span><span class="mi">-48</span><span class="p">;</span><span class="n">ch</span> <span class="o">=</span> <span class="n">getc</span><span class="p">();}</span><span class="k">if</span><span class="p">(</span><span class="n">f</span><span class="p">)</span><span class="n">t</span><span class="o">=-</span><span class="n">t</span><span class="p">;</span>
<span class="linenos" data-linenos=" 13 "></span>    <span class="p">}</span>
<span class="linenos" data-linenos=" 14 "></span>    <span class="k">template</span> <span class="o">&lt;</span><span class="k">typename</span> <span class="nc">T</span><span class="p">,</span><span class="k">typename</span><span class="p">...</span> <span class="n">Args</span><span class="o">&gt;</span> <span class="kr">inline</span> <span class="kt">void</span> <span class="n">read</span><span class="p">(</span><span class="n">T</span><span class="o">&amp;</span> <span class="n">t</span><span class="p">,</span> <span class="n">Args</span><span class="o">&amp;</span><span class="p">...</span> <span class="n">args</span><span class="p">){</span><span class="n">read</span><span class="p">(</span><span class="n">t</span><span class="p">);</span><span class="n">read</span><span class="p">(</span><span class="n">args</span><span class="p">...);}</span>
<span class="linenos" data-linenos=" 15 "></span><span class="p">}</span>
<span class="linenos" data-linenos=" 16 "></span><span class="k">namespace</span> <span class="n">out</span><span class="p">{</span>
<span class="linenos" data-linenos=" 17 "></span>    <span class="kt">char</span> <span class="n">buffer</span><span class="p">[</span><span class="mi">1</span><span class="o">&lt;&lt;</span><span class="mi">21</span><span class="p">];</span><span class="kt">int</span> <span class="n">p1</span><span class="o">=</span><span class="mi">-1</span><span class="p">;</span><span class="k">const</span> <span class="kt">int</span> <span class="n">p2</span> <span class="o">=</span> <span class="p">(</span><span class="mi">1</span><span class="o">&lt;&lt;</span><span class="mi">21</span><span class="p">)</span><span class="mi">-1</span><span class="p">;</span>
<span class="linenos" data-linenos=" 18 "></span>    <span class="kr">inline</span> <span class="kt">void</span> <span class="n">flush</span><span class="p">(){</span><span class="n">fwrite</span><span class="p">(</span><span class="n">buffer</span><span class="p">,</span><span class="mi">1</span><span class="p">,</span><span class="n">p1</span><span class="o">+</span><span class="mi">1</span><span class="p">,</span><span class="n">stdout</span><span class="p">),</span><span class="n">p1</span><span class="o">=</span><span class="mi">-1</span><span class="p">;}</span>
<span class="linenos" data-linenos=" 19 "></span>    <span class="kr">inline</span> <span class="kt">void</span> <span class="n">putc</span><span class="p">(</span><span class="k">const</span> <span class="kt">char</span> <span class="o">&amp;</span><span class="n">x</span><span class="p">)</span> <span class="p">{</span><span class="k">if</span><span class="p">(</span><span class="n">p1</span><span class="o">==</span><span class="n">p2</span><span class="p">)</span><span class="n">flush</span><span class="p">();</span><span class="n">buffer</span><span class="p">[</span><span class="o">++</span><span class="n">p1</span><span class="p">]</span><span class="o">=</span><span class="n">x</span><span class="p">;}</span>
<span class="linenos" data-linenos=" 20 "></span>    <span class="k">template</span> <span class="o">&lt;</span><span class="k">typename</span> <span class="nc">T</span><span class="o">&gt;</span><span class="kt">void</span> <span class="n">write</span><span class="p">(</span><span class="n">T</span> <span class="n">x</span><span class="p">)</span> <span class="p">{</span>
<span class="linenos" data-linenos=" 21 "></span>        <span class="k">static</span> <span class="kt">char</span> <span class="n">buf</span><span class="p">[</span><span class="mi">15</span><span class="p">];</span><span class="k">static</span> <span class="kt">int</span> <span class="n">len</span><span class="o">=</span><span class="mi">-1</span><span class="p">;</span><span class="k">if</span><span class="p">(</span><span class="n">x</span><span class="o">&gt;=</span><span class="mi">0</span><span class="p">){</span><span class="k">do</span><span class="p">{</span><span class="n">buf</span><span class="p">[</span><span class="o">++</span><span class="n">len</span><span class="p">]</span><span class="o">=</span><span class="n">x</span><span class="o">%</span><span class="mi">10</span><span class="o">+</span><span class="mi">48</span><span class="p">,</span><span class="n">x</span><span class="o">/=</span><span class="mi">10</span><span class="p">;}</span><span class="k">while</span> <span class="p">(</span><span class="n">x</span><span class="p">);}</span><span class="k">else</span><span class="p">{</span><span class="n">putc</span><span class="p">(</span><span class="sc">&#39;-&#39;</span><span class="p">);</span><span class="k">do</span> <span class="p">{</span><span class="n">buf</span><span class="p">[</span><span class="o">++</span><span class="n">len</span><span class="p">]</span><span class="o">=-</span><span class="p">(</span><span class="n">x</span><span class="o">%</span><span class="mi">10</span><span class="p">)</span><span class="o">+</span><span class="mi">48</span><span class="p">,</span><span class="n">x</span><span class="o">/=</span><span class="mi">10</span><span class="p">;}</span><span class="k">while</span><span class="p">(</span><span class="n">x</span><span class="p">);}</span>
<span class="linenos" data-linenos=" 22 "></span>        <span class="k">while</span> <span class="p">(</span><span class="n">len</span><span class="o">&gt;=</span><span class="mi">0</span><span class="p">)</span><span class="n">putc</span><span class="p">(</span><span class="n">buf</span><span class="p">[</span><span class="n">len</span><span class="p">]),</span><span class="o">--</span><span class="n">len</span><span class="p">;</span>
<span class="linenos" data-linenos=" 23 "></span>    <span class="p">}</span>
<span class="linenos" data-linenos=" 24 "></span><span class="p">}</span>
<span class="linenos" data-linenos=" 25 "></span><span class="k">using</span> <span class="k">namespace</span> <span class="n">std</span><span class="p">;</span>
<span class="linenos" data-linenos=" 26 "></span><span class="k">template</span><span class="o">&lt;</span><span class="k">const</span> <span class="kt">int</span> <span class="n">mod</span><span class="o">&gt;</span>
<span class="linenos" data-linenos=" 27 "></span><span class="k">struct</span> <span class="nc">modint</span><span class="p">{</span>
<span class="linenos" data-linenos=" 28 "></span>    <span class="kt">int</span> <span class="n">x</span><span class="p">;</span>
<span class="linenos" data-linenos=" 29 "></span>    <span class="n">modint</span><span class="o">&lt;</span><span class="n">mod</span><span class="o">&gt;</span><span class="p">(</span><span class="kt">int</span> <span class="n">o</span><span class="o">=</span><span class="mi">0</span><span class="p">){</span><span class="n">x</span><span class="o">=</span><span class="n">o</span><span class="p">;}</span>
<span class="linenos" data-linenos=" 30 "></span>    <span class="n">modint</span><span class="o">&lt;</span><span class="n">mod</span><span class="o">&gt;</span> <span class="o">&amp;</span><span class="k">operator</span> <span class="o">=</span> <span class="p">(</span><span class="kt">int</span> <span class="n">o</span><span class="p">){</span><span class="k">return</span> <span class="n">x</span><span class="o">=</span><span class="n">o</span><span class="p">,</span><span class="o">*</span><span class="k">this</span><span class="p">;}</span>
<span class="linenos" data-linenos=" 31 "></span>    <span class="n">modint</span><span class="o">&lt;</span><span class="n">mod</span><span class="o">&gt;</span> <span class="o">&amp;</span><span class="k">operator</span> <span class="o">+=</span><span class="p">(</span><span class="n">modint</span><span class="o">&lt;</span><span class="n">mod</span><span class="o">&gt;</span> <span class="n">o</span><span class="p">){</span><span class="k">return</span> <span class="n">x</span><span class="o">=</span><span class="n">x</span><span class="o">+</span><span class="n">o</span><span class="p">.</span><span class="n">x</span><span class="o">&gt;=</span><span class="n">mod</span><span class="o">?</span><span class="n">x</span><span class="o">+</span><span class="n">o</span><span class="p">.</span><span class="n">x</span><span class="o">-</span><span class="nl">mod</span><span class="p">:</span><span class="n">x</span><span class="o">+</span><span class="n">o</span><span class="p">.</span><span class="n">x</span><span class="p">,</span><span class="o">*</span><span class="k">this</span><span class="p">;}</span>
<span class="linenos" data-linenos=" 32 "></span>    <span class="n">modint</span><span class="o">&lt;</span><span class="n">mod</span><span class="o">&gt;</span> <span class="o">&amp;</span><span class="k">operator</span> <span class="o">-=</span><span class="p">(</span><span class="n">modint</span><span class="o">&lt;</span><span class="n">mod</span><span class="o">&gt;</span> <span class="n">o</span><span class="p">){</span><span class="k">return</span> <span class="n">x</span><span class="o">=</span><span class="n">x</span><span class="o">-</span><span class="n">o</span><span class="p">.</span><span class="n">x</span><span class="o">&lt;</span><span class="mi">0</span><span class="o">?</span><span class="n">x</span><span class="o">-</span><span class="n">o</span><span class="p">.</span><span class="n">x</span><span class="o">+</span><span class="nl">mod</span><span class="p">:</span><span class="n">x</span><span class="o">-</span><span class="n">o</span><span class="p">.</span><span class="n">x</span><span class="p">,</span><span class="o">*</span><span class="k">this</span><span class="p">;}</span>
<span class="linenos" data-linenos=" 33 "></span>    <span class="n">modint</span><span class="o">&lt;</span><span class="n">mod</span><span class="o">&gt;</span> <span class="o">&amp;</span><span class="k">operator</span> <span class="o">*=</span><span class="p">(</span><span class="n">modint</span><span class="o">&lt;</span><span class="n">mod</span><span class="o">&gt;</span> <span class="n">o</span><span class="p">){</span><span class="k">return</span> <span class="n">x</span><span class="o">=</span><span class="mf">1l</span><span class="n">l</span><span class="o">*</span><span class="n">x</span><span class="o">*</span><span class="n">o</span><span class="p">.</span><span class="n">x</span><span class="o">%</span><span class="n">mod</span><span class="p">,</span><span class="o">*</span><span class="k">this</span><span class="p">;}</span>
<span class="linenos" data-linenos=" 34 "></span>    <span class="n">modint</span><span class="o">&lt;</span><span class="n">mod</span><span class="o">&gt;</span> <span class="o">&amp;</span><span class="k">operator</span> <span class="o">^=</span><span class="p">(</span><span class="kt">int</span> <span class="n">b</span><span class="p">){</span>
<span class="linenos" data-linenos=" 35 "></span>        <span class="n">modint</span><span class="o">&lt;</span><span class="n">mod</span><span class="o">&gt;</span> <span class="n">a</span><span class="o">=*</span><span class="k">this</span><span class="p">,</span><span class="n">c</span><span class="o">=</span><span class="mi">1</span><span class="p">;</span>
<span class="linenos" data-linenos=" 36 "></span>        <span class="k">for</span><span class="p">(;</span><span class="n">b</span><span class="p">;</span><span class="n">b</span><span class="o">&gt;&gt;=</span><span class="mi">1</span><span class="p">,</span><span class="n">a</span><span class="o">*=</span><span class="n">a</span><span class="p">)</span><span class="k">if</span><span class="p">(</span><span class="n">b</span><span class="o">&amp;</span><span class="mi">1</span><span class="p">)</span><span class="n">c</span><span class="o">*=</span><span class="n">a</span><span class="p">;</span>
<span class="linenos" data-linenos=" 37 "></span>        <span class="k">return</span> <span class="n">x</span><span class="o">=</span><span class="n">c</span><span class="p">.</span><span class="n">x</span><span class="p">,</span><span class="o">*</span><span class="k">this</span><span class="p">;</span>
<span class="linenos" data-linenos=" 38 "></span>    <span class="p">}</span>
<span class="linenos" data-linenos=" 39 "></span>    <span class="n">modint</span><span class="o">&lt;</span><span class="n">mod</span><span class="o">&gt;</span> <span class="o">&amp;</span><span class="k">operator</span> <span class="o">/=</span><span class="p">(</span><span class="n">modint</span><span class="o">&lt;</span><span class="n">mod</span><span class="o">&gt;</span> <span class="n">o</span><span class="p">){</span><span class="k">return</span> <span class="o">*</span><span class="k">this</span> <span class="o">*=</span><span class="n">o</span><span class="o">^=</span><span class="n">mod</span><span class="mi">-2</span><span class="p">;}</span>
<span class="linenos" data-linenos=" 40 "></span>    <span class="n">modint</span><span class="o">&lt;</span><span class="n">mod</span><span class="o">&gt;</span> <span class="o">&amp;</span><span class="k">operator</span> <span class="o">+=</span><span class="p">(</span><span class="kt">int</span> <span class="n">o</span><span class="p">){</span><span class="k">return</span> <span class="n">x</span><span class="o">=</span><span class="n">x</span><span class="o">+</span><span class="n">o</span><span class="o">&gt;=</span><span class="n">mod</span><span class="o">?</span><span class="n">x</span><span class="o">+</span><span class="n">o</span><span class="o">-</span><span class="nl">mod</span><span class="p">:</span><span class="n">x</span><span class="o">+</span><span class="n">o</span><span class="p">,</span><span class="o">*</span><span class="k">this</span><span class="p">;}</span>
<span class="linenos" data-linenos=" 41 "></span>    <span class="n">modint</span><span class="o">&lt;</span><span class="n">mod</span><span class="o">&gt;</span> <span class="o">&amp;</span><span class="k">operator</span> <span class="o">-=</span><span class="p">(</span><span class="kt">int</span> <span class="n">o</span><span class="p">){</span><span class="k">return</span> <span class="n">x</span><span class="o">=</span><span class="n">x</span><span class="o">-</span><span class="n">o</span><span class="o">&lt;</span><span class="mi">0</span><span class="o">?</span><span class="n">x</span><span class="o">-</span><span class="n">o</span><span class="o">+</span><span class="nl">mod</span><span class="p">:</span><span class="n">x</span><span class="o">-</span><span class="n">o</span><span class="p">,</span><span class="o">*</span><span class="k">this</span><span class="p">;}</span>
<span class="linenos" data-linenos=" 42 "></span>    <span class="n">modint</span><span class="o">&lt;</span><span class="n">mod</span><span class="o">&gt;</span> <span class="o">&amp;</span><span class="k">operator</span> <span class="o">*=</span><span class="p">(</span><span class="kt">int</span> <span class="n">o</span><span class="p">){</span><span class="k">return</span> <span class="n">x</span><span class="o">=</span><span class="mf">1l</span><span class="n">l</span><span class="o">*</span><span class="n">x</span><span class="o">*</span><span class="n">o</span><span class="o">%</span><span class="n">mod</span><span class="p">,</span><span class="o">*</span><span class="k">this</span><span class="p">;}</span>
<span class="linenos" data-linenos=" 43 "></span>    <span class="n">modint</span><span class="o">&lt;</span><span class="n">mod</span><span class="o">&gt;</span> <span class="o">&amp;</span><span class="k">operator</span> <span class="o">/=</span><span class="p">(</span><span class="kt">int</span> <span class="n">o</span><span class="p">){</span><span class="k">return</span> <span class="o">*</span><span class="k">this</span> <span class="o">*=</span> <span class="p">((</span><span class="n">modint</span><span class="o">&lt;</span><span class="n">mod</span><span class="o">&gt;</span><span class="p">(</span><span class="n">o</span><span class="p">))</span><span class="o">^=</span><span class="n">mod</span><span class="mi">-2</span><span class="p">);}</span>
<span class="linenos" data-linenos=" 44 "></span>    <span class="k">template</span><span class="o">&lt;</span><span class="k">class</span> <span class="nc">I</span><span class="o">&gt;</span><span class="k">friend</span> <span class="n">modint</span><span class="o">&lt;</span><span class="n">mod</span><span class="o">&gt;</span> <span class="k">operator</span> <span class="o">+</span><span class="p">(</span><span class="n">modint</span><span class="o">&lt;</span><span class="n">mod</span><span class="o">&gt;</span> <span class="n">a</span><span class="p">,</span><span class="n">I</span> <span class="n">b</span><span class="p">){</span><span class="k">return</span> <span class="n">a</span><span class="o">+=</span><span class="n">b</span><span class="p">;}</span>
<span class="linenos" data-linenos=" 45 "></span>    <span class="k">template</span><span class="o">&lt;</span><span class="k">class</span> <span class="nc">I</span><span class="o">&gt;</span><span class="k">friend</span> <span class="n">modint</span><span class="o">&lt;</span><span class="n">mod</span><span class="o">&gt;</span> <span class="k">operator</span> <span class="o">-</span><span class="p">(</span><span class="n">modint</span><span class="o">&lt;</span><span class="n">mod</span><span class="o">&gt;</span> <span class="n">a</span><span class="p">,</span><span class="n">I</span> <span class="n">b</span><span class="p">){</span><span class="k">return</span> <span class="n">a</span><span class="o">-=</span><span class="n">b</span><span class="p">;}</span>
<span class="linenos" data-linenos=" 46 "></span>    <span class="k">template</span><span class="o">&lt;</span><span class="k">class</span> <span class="nc">I</span><span class="o">&gt;</span><span class="k">friend</span> <span class="n">modint</span><span class="o">&lt;</span><span class="n">mod</span><span class="o">&gt;</span> <span class="k">operator</span> <span class="o">*</span><span class="p">(</span><span class="n">modint</span><span class="o">&lt;</span><span class="n">mod</span><span class="o">&gt;</span> <span class="n">a</span><span class="p">,</span><span class="n">I</span> <span class="n">b</span><span class="p">){</span><span class="k">return</span> <span class="n">a</span><span class="o">*=</span><span class="n">b</span><span class="p">;}</span>
<span class="linenos" data-linenos=" 47 "></span>    <span class="k">template</span><span class="o">&lt;</span><span class="k">class</span> <span class="nc">I</span><span class="o">&gt;</span><span class="k">friend</span> <span class="n">modint</span><span class="o">&lt;</span><span class="n">mod</span><span class="o">&gt;</span> <span class="k">operator</span> <span class="o">/</span><span class="p">(</span><span class="n">modint</span><span class="o">&lt;</span><span class="n">mod</span><span class="o">&gt;</span> <span class="n">a</span><span class="p">,</span><span class="n">I</span> <span class="n">b</span><span class="p">){</span><span class="k">return</span> <span class="n">a</span><span class="o">/=</span><span class="n">b</span><span class="p">;}</span>
<span class="linenos" data-linenos=" 48 "></span>    <span class="k">friend</span> <span class="n">modint</span><span class="o">&lt;</span><span class="n">mod</span><span class="o">&gt;</span> <span class="k">operator</span> <span class="o">^</span><span class="p">(</span><span class="n">modint</span><span class="o">&lt;</span><span class="n">mod</span><span class="o">&gt;</span> <span class="n">a</span><span class="p">,</span><span class="kt">int</span> <span class="n">b</span><span class="p">){</span><span class="k">return</span> <span class="n">a</span><span class="o">^=</span><span class="n">b</span><span class="p">;}</span>
<span class="linenos" data-linenos=" 49 "></span>    <span class="k">friend</span> <span class="kt">bool</span> <span class="k">operator</span> <span class="o">==</span><span class="p">(</span><span class="n">modint</span><span class="o">&lt;</span><span class="n">mod</span><span class="o">&gt;</span> <span class="n">a</span><span class="p">,</span><span class="kt">int</span> <span class="n">b</span><span class="p">){</span><span class="k">return</span> <span class="n">a</span><span class="p">.</span><span class="n">x</span><span class="o">==</span><span class="n">b</span><span class="p">;}</span>
<span class="linenos" data-linenos=" 50 "></span>    <span class="k">friend</span> <span class="kt">bool</span> <span class="k">operator</span> <span class="o">!=</span><span class="p">(</span><span class="n">modint</span><span class="o">&lt;</span><span class="n">mod</span><span class="o">&gt;</span> <span class="n">a</span><span class="p">,</span><span class="kt">int</span> <span class="n">b</span><span class="p">){</span><span class="k">return</span> <span class="n">a</span><span class="p">.</span><span class="n">x</span><span class="o">!=</span><span class="n">b</span><span class="p">;}</span>
<span class="linenos" data-linenos=" 51 "></span>    <span class="kt">bool</span> <span class="k">operator</span> <span class="o">!</span> <span class="p">()</span> <span class="p">{</span><span class="k">return</span> <span class="o">!</span><span class="n">x</span><span class="p">;}</span>
<span class="linenos" data-linenos=" 52 "></span>    <span class="n">modint</span><span class="o">&lt;</span><span class="n">mod</span><span class="o">&gt;</span> <span class="k">operator</span> <span class="o">-</span> <span class="p">()</span> <span class="p">{</span><span class="k">return</span> <span class="n">x</span><span class="o">?</span><span class="n">mod</span><span class="o">-</span><span class="nl">x</span><span class="p">:</span><span class="mi">0</span><span class="p">;}</span>
<span class="linenos" data-linenos=" 53 "></span>    <span class="n">modint</span><span class="o">&lt;</span><span class="n">mod</span><span class="o">&gt;</span> <span class="o">&amp;</span><span class="k">operator</span><span class="o">++</span><span class="p">(</span><span class="kt">int</span><span class="p">){</span><span class="k">return</span> <span class="o">*</span><span class="k">this</span><span class="o">+=</span><span class="mi">1</span><span class="p">;}</span>
<span class="linenos" data-linenos=" 54 "></span><span class="p">};</span>
<span class="linenos" data-linenos=" 55 "></span><span class="k">const</span> <span class="kt">int</span> <span class="n">N</span><span class="o">=</span><span class="mf">4e6</span><span class="o">+</span><span class="mi">5</span><span class="p">;</span>
<span class="linenos" data-linenos=" 56 "></span>
<span class="linenos" data-linenos=" 57 "></span><span class="k">const</span> <span class="kt">int</span> <span class="n">mod</span><span class="o">=</span><span class="mi">998244353</span><span class="p">;</span>
<span class="linenos" data-linenos=" 58 "></span><span class="k">const</span> <span class="n">modint</span><span class="o">&lt;</span><span class="n">mod</span><span class="o">&gt;</span> <span class="n">GG</span><span class="o">=</span><span class="mi">3</span><span class="p">,</span><span class="n">Ginv</span><span class="o">=</span><span class="n">modint</span><span class="o">&lt;</span><span class="n">mod</span><span class="o">&gt;</span><span class="p">(</span><span class="mi">1</span><span class="p">)</span><span class="o">/</span><span class="mi">3</span><span class="p">,</span><span class="n">I</span><span class="o">=</span><span class="mi">86583718</span><span class="p">;</span>
<span class="linenos" data-linenos=" 59 "></span><span class="k">struct</span> <span class="nc">poly</span><span class="p">{</span>
<span class="linenos" data-linenos=" 60 "></span>    <span class="n">vector</span><span class="o">&lt;</span><span class="n">modint</span><span class="o">&lt;</span><span class="n">mod</span><span class="o">&gt;&gt;</span><span class="n">a</span><span class="p">;</span>
<span class="linenos" data-linenos=" 61 "></span>    <span class="n">modint</span><span class="o">&lt;</span><span class="n">mod</span><span class="o">&gt;&amp;</span><span class="k">operator</span><span class="p">[](</span><span class="kt">int</span> <span class="n">i</span><span class="p">){</span><span class="k">return</span> <span class="n">a</span><span class="p">[</span><span class="n">i</span><span class="p">];}</span>
<span class="linenos" data-linenos=" 62 "></span>    <span class="kt">int</span> <span class="n">size</span><span class="p">(){</span><span class="k">return</span> <span class="n">a</span><span class="p">.</span><span class="n">size</span><span class="p">();}</span>
<span class="linenos" data-linenos=" 63 "></span>    <span class="kt">void</span> <span class="n">print</span><span class="p">(){</span><span class="k">for</span><span class="p">(</span><span class="kt">int</span> <span class="n">i</span><span class="o">=</span><span class="mi">0</span><span class="p">;</span><span class="n">i</span><span class="o">&lt;</span><span class="n">size</span><span class="p">();</span><span class="n">i</span><span class="o">++</span><span class="p">)</span><span class="n">printf</span><span class="p">(</span><span class="s">&quot;%d &quot;</span><span class="p">,</span><span class="n">a</span><span class="p">[</span><span class="n">i</span><span class="p">]);</span><span class="n">printf</span><span class="p">(</span><span class="s">&quot;</span><span class="se">\n</span><span class="s">&quot;</span><span class="p">);}</span>
<span class="linenos" data-linenos=" 64 "></span>    <span class="kt">void</span> <span class="n">resize</span><span class="p">(</span><span class="kt">int</span> <span class="n">n</span><span class="p">){</span><span class="n">a</span><span class="p">.</span><span class="n">resize</span><span class="p">(</span><span class="n">n</span><span class="p">);}</span>
<span class="linenos" data-linenos=" 65 "></span>    <span class="kt">void</span> <span class="n">reverse</span><span class="p">(){</span><span class="n">std</span><span class="o">::</span><span class="n">reverse</span><span class="p">(</span><span class="n">a</span><span class="p">.</span><span class="n">begin</span><span class="p">(),</span><span class="n">a</span><span class="p">.</span><span class="n">end</span><span class="p">());}</span>
<span class="linenos" data-linenos=" 66 "></span><span class="p">};</span>
<span class="linenos" data-linenos=" 67 "></span><span class="kt">int</span> <span class="n">rev</span><span class="p">[</span><span class="n">N</span><span class="p">];</span>
<span class="linenos" data-linenos=" 68 "></span><span class="kr">inline</span> <span class="kt">int</span> <span class="n">ext</span><span class="p">(</span><span class="kt">int</span> <span class="n">n</span><span class="p">){</span><span class="kt">int</span> <span class="n">k</span><span class="o">=</span><span class="mi">0</span><span class="p">;</span><span class="k">while</span><span class="p">((</span><span class="mi">1</span><span class="o">&lt;&lt;</span><span class="n">k</span><span class="p">)</span><span class="o">&lt;</span><span class="n">n</span><span class="p">)</span><span class="n">k</span><span class="o">++</span><span class="p">;</span><span class="k">return</span> <span class="n">k</span><span class="p">;}</span>
<span class="linenos" data-linenos=" 69 "></span><span class="kr">inline</span> <span class="kt">void</span> <span class="n">init</span><span class="p">(</span><span class="kt">int</span> <span class="n">k</span><span class="p">){</span><span class="kt">int</span> <span class="n">n</span><span class="o">=</span><span class="mi">1</span><span class="o">&lt;&lt;</span><span class="n">k</span><span class="p">;</span><span class="k">for</span><span class="p">(</span><span class="kt">int</span> <span class="n">i</span><span class="o">=</span><span class="mi">0</span><span class="p">;</span><span class="n">i</span><span class="o">&lt;</span><span class="n">n</span><span class="p">;</span><span class="n">i</span><span class="o">++</span><span class="p">)</span><span class="n">rev</span><span class="p">[</span><span class="n">i</span><span class="p">]</span><span class="o">=</span><span class="p">(</span><span class="n">rev</span><span class="p">[</span><span class="n">i</span><span class="o">&gt;&gt;</span><span class="mi">1</span><span class="p">]</span><span class="o">&gt;&gt;</span><span class="mi">1</span><span class="p">)</span><span class="o">|</span><span class="p">((</span><span class="n">i</span><span class="o">&amp;</span><span class="mi">1</span><span class="p">)</span><span class="o">&lt;&lt;</span><span class="p">(</span><span class="n">k</span><span class="mi">-1</span><span class="p">));}</span>
<span class="linenos" data-linenos=" 70 "></span><span class="kr">inline</span> <span class="kt">void</span> <span class="n">ntt</span><span class="p">(</span><span class="n">poly</span><span class="o">&amp;</span><span class="n">a</span><span class="p">,</span><span class="kt">int</span> <span class="n">k</span><span class="p">,</span><span class="kt">int</span> <span class="n">typ</span><span class="p">){</span>
<span class="linenos" data-linenos=" 71 "></span>    <span class="kt">int</span> <span class="n">n</span><span class="o">=</span><span class="mi">1</span><span class="o">&lt;&lt;</span><span class="n">k</span><span class="p">;</span>
<span class="linenos" data-linenos=" 72 "></span>    <span class="k">for</span><span class="p">(</span><span class="kt">int</span> <span class="n">i</span><span class="o">=</span><span class="mi">0</span><span class="p">;</span><span class="n">i</span><span class="o">&lt;</span><span class="n">n</span><span class="p">;</span><span class="n">i</span><span class="o">++</span><span class="p">)</span><span class="k">if</span><span class="p">(</span><span class="n">i</span><span class="o">&lt;</span><span class="n">rev</span><span class="p">[</span><span class="n">i</span><span class="p">])</span><span class="n">swap</span><span class="p">(</span><span class="n">a</span><span class="p">[</span><span class="n">i</span><span class="p">],</span><span class="n">a</span><span class="p">[</span><span class="n">rev</span><span class="p">[</span><span class="n">i</span><span class="p">]]);</span>
<span class="linenos" data-linenos=" 73 "></span>    <span class="k">for</span><span class="p">(</span><span class="kt">int</span> <span class="n">mid</span><span class="o">=</span><span class="mi">1</span><span class="p">;</span><span class="n">mid</span><span class="o">&lt;</span><span class="n">n</span><span class="p">;</span><span class="n">mid</span><span class="o">&lt;&lt;=</span><span class="mi">1</span><span class="p">){</span>
<span class="linenos" data-linenos=" 74 "></span>        <span class="n">modint</span><span class="o">&lt;</span><span class="n">mod</span><span class="o">&gt;</span> <span class="n">wn</span><span class="o">=</span><span class="p">(</span><span class="n">typ</span><span class="o">&gt;</span><span class="mi">0</span><span class="o">?</span><span class="nl">GG</span><span class="p">:</span><span class="n">Ginv</span><span class="p">)</span><span class="o">^</span><span class="p">((</span><span class="n">mod</span><span class="mi">-1</span><span class="p">)</span><span class="o">/</span><span class="p">(</span><span class="n">mid</span><span class="o">&lt;&lt;</span><span class="mi">1</span><span class="p">));</span>
<span class="linenos" data-linenos=" 75 "></span>        <span class="k">for</span><span class="p">(</span><span class="kt">int</span> <span class="n">r</span><span class="o">=</span><span class="n">mid</span><span class="o">&lt;&lt;</span><span class="mi">1</span><span class="p">,</span><span class="n">j</span><span class="o">=</span><span class="mi">0</span><span class="p">;</span><span class="n">j</span><span class="o">&lt;</span><span class="n">n</span><span class="p">;</span><span class="n">j</span><span class="o">+=</span><span class="n">r</span><span class="p">){</span>
<span class="linenos" data-linenos=" 76 "></span>            <span class="n">modint</span><span class="o">&lt;</span><span class="n">mod</span><span class="o">&gt;</span> <span class="n">w</span><span class="o">=</span><span class="mi">1</span><span class="p">;</span>
<span class="linenos" data-linenos=" 77 "></span>            <span class="k">for</span><span class="p">(</span><span class="kt">int</span> <span class="n">k</span><span class="o">=</span><span class="mi">0</span><span class="p">;</span><span class="n">k</span><span class="o">&lt;</span><span class="n">mid</span><span class="p">;</span><span class="n">k</span><span class="o">++</span><span class="p">,</span><span class="n">w</span><span class="o">=</span><span class="n">w</span><span class="o">*</span><span class="n">wn</span><span class="p">){</span>
<span class="linenos" data-linenos=" 78 "></span>                <span class="n">modint</span><span class="o">&lt;</span><span class="n">mod</span><span class="o">&gt;</span> <span class="n">x</span><span class="o">=</span><span class="n">a</span><span class="p">[</span><span class="n">j</span><span class="o">+</span><span class="n">k</span><span class="p">],</span><span class="n">y</span><span class="o">=</span><span class="n">w</span><span class="o">*</span><span class="n">a</span><span class="p">[</span><span class="n">j</span><span class="o">+</span><span class="n">k</span><span class="o">+</span><span class="n">mid</span><span class="p">];</span>
<span class="linenos" data-linenos=" 79 "></span>                <span class="n">a</span><span class="p">[</span><span class="n">j</span><span class="o">+</span><span class="n">k</span><span class="p">]</span><span class="o">=</span><span class="n">x</span><span class="o">+</span><span class="n">y</span><span class="p">,</span><span class="n">a</span><span class="p">[</span><span class="n">j</span><span class="o">+</span><span class="n">k</span><span class="o">+</span><span class="n">mid</span><span class="p">]</span><span class="o">=</span><span class="n">x</span><span class="o">-</span><span class="n">y</span><span class="p">;</span>
<span class="linenos" data-linenos=" 80 "></span>            <span class="p">}</span>
<span class="linenos" data-linenos=" 81 "></span>        <span class="p">}</span>
<span class="linenos" data-linenos=" 82 "></span>    <span class="p">}</span>
<span class="linenos" data-linenos=" 83 "></span>    <span class="k">if</span><span class="p">(</span><span class="n">typ</span><span class="o">&lt;</span><span class="mi">0</span><span class="p">){</span>
<span class="linenos" data-linenos=" 84 "></span>        <span class="n">modint</span><span class="o">&lt;</span><span class="n">mod</span><span class="o">&gt;</span> <span class="n">inv</span><span class="o">=</span><span class="n">modint</span><span class="o">&lt;</span><span class="n">mod</span><span class="o">&gt;</span><span class="p">(</span><span class="mi">1</span><span class="p">)</span><span class="o">/</span><span class="n">n</span><span class="p">;</span>
<span class="linenos" data-linenos=" 85 "></span>        <span class="k">for</span><span class="p">(</span><span class="kt">int</span> <span class="n">i</span><span class="o">=</span><span class="mi">0</span><span class="p">;</span><span class="n">i</span><span class="o">&lt;</span><span class="n">n</span><span class="p">;</span><span class="n">i</span><span class="o">++</span><span class="p">)</span><span class="n">a</span><span class="p">[</span><span class="n">i</span><span class="p">]</span><span class="o">*=</span><span class="n">inv</span><span class="p">;</span>
<span class="linenos" data-linenos=" 86 "></span>    <span class="p">}</span>
<span class="linenos" data-linenos=" 87 "></span><span class="p">}</span>
<span class="linenos" data-linenos=" 88 "></span><span class="kr">inline</span> <span class="n">poly</span> <span class="n">one</span><span class="p">(){</span><span class="n">poly</span> <span class="n">a</span><span class="p">;</span><span class="n">a</span><span class="p">.</span><span class="n">a</span><span class="p">.</span><span class="n">push_back</span><span class="p">(</span><span class="mi">1</span><span class="p">);</span><span class="k">return</span> <span class="n">a</span><span class="p">;}</span>
<span class="linenos" data-linenos=" 89 "></span><span class="n">poly</span> <span class="k">operator</span> <span class="o">+</span><span class="p">(</span><span class="n">poly</span> <span class="n">a</span><span class="p">,</span><span class="n">poly</span> <span class="n">b</span><span class="p">){</span>
<span class="linenos" data-linenos=" 90 "></span>    <span class="kt">int</span> <span class="n">n</span><span class="o">=</span><span class="n">max</span><span class="p">(</span><span class="n">a</span><span class="p">.</span><span class="n">size</span><span class="p">(),</span><span class="n">b</span><span class="p">.</span><span class="n">size</span><span class="p">());</span><span class="n">a</span><span class="p">.</span><span class="n">resize</span><span class="p">(</span><span class="n">n</span><span class="p">),</span><span class="n">b</span><span class="p">.</span><span class="n">resize</span><span class="p">(</span><span class="n">n</span><span class="p">);</span>
<span class="linenos" data-linenos=" 91 "></span>    <span class="k">for</span><span class="p">(</span><span class="kt">int</span> <span class="n">i</span><span class="o">=</span><span class="mi">0</span><span class="p">;</span><span class="n">i</span><span class="o">&lt;</span><span class="n">n</span><span class="p">;</span><span class="n">i</span><span class="o">++</span><span class="p">)</span><span class="n">a</span><span class="p">[</span><span class="n">i</span><span class="p">]</span><span class="o">+=</span><span class="n">b</span><span class="p">[</span><span class="n">i</span><span class="p">];</span><span class="k">return</span> <span class="n">a</span><span class="p">;</span>
<span class="linenos" data-linenos=" 92 "></span><span class="p">}</span>
<span class="linenos" data-linenos=" 93 "></span><span class="n">poly</span> <span class="k">operator</span> <span class="o">-</span><span class="p">(</span><span class="n">poly</span> <span class="n">a</span><span class="p">,</span><span class="n">poly</span> <span class="n">b</span><span class="p">){</span>
<span class="linenos" data-linenos=" 94 "></span>    <span class="kt">int</span> <span class="n">n</span><span class="o">=</span><span class="n">max</span><span class="p">(</span><span class="n">a</span><span class="p">.</span><span class="n">size</span><span class="p">(),</span><span class="n">b</span><span class="p">.</span><span class="n">size</span><span class="p">());</span><span class="n">a</span><span class="p">.</span><span class="n">resize</span><span class="p">(</span><span class="n">n</span><span class="p">),</span><span class="n">b</span><span class="p">.</span><span class="n">resize</span><span class="p">(</span><span class="n">n</span><span class="p">);</span>
<span class="linenos" data-linenos=" 95 "></span>    <span class="k">for</span><span class="p">(</span><span class="kt">int</span> <span class="n">i</span><span class="o">=</span><span class="mi">0</span><span class="p">;</span><span class="n">i</span><span class="o">&lt;</span><span class="n">n</span><span class="p">;</span><span class="n">i</span><span class="o">++</span><span class="p">)</span><span class="n">a</span><span class="p">[</span><span class="n">i</span><span class="p">]</span><span class="o">-=</span><span class="n">b</span><span class="p">[</span><span class="n">i</span><span class="p">];</span><span class="k">return</span> <span class="n">a</span><span class="p">;</span>
<span class="linenos" data-linenos=" 96 "></span><span class="p">}</span>
<span class="linenos" data-linenos=" 97 "></span><span class="kr">inline</span> <span class="n">poly</span> <span class="k">operator</span><span class="o">*</span><span class="p">(</span><span class="n">poly</span> <span class="n">a</span><span class="p">,</span><span class="n">poly</span> <span class="n">b</span><span class="p">){</span>
<span class="linenos" data-linenos=" 98 "></span>    <span class="kt">int</span> <span class="n">n</span><span class="o">=</span><span class="n">a</span><span class="p">.</span><span class="n">size</span><span class="p">()</span><span class="o">+</span><span class="n">b</span><span class="p">.</span><span class="n">size</span><span class="p">()</span><span class="mi">-1</span><span class="p">,</span><span class="n">k</span><span class="o">=</span><span class="n">ext</span><span class="p">(</span><span class="n">n</span><span class="p">);</span>
<span class="linenos" data-linenos=" 99 "></span>    <span class="n">a</span><span class="p">.</span><span class="n">resize</span><span class="p">(</span><span class="mi">1</span><span class="o">&lt;&lt;</span><span class="n">k</span><span class="p">),</span><span class="n">b</span><span class="p">.</span><span class="n">resize</span><span class="p">(</span><span class="mi">1</span><span class="o">&lt;&lt;</span><span class="n">k</span><span class="p">),</span><span class="n">init</span><span class="p">(</span><span class="n">k</span><span class="p">);</span>
<span class="linenos" data-linenos="100 "></span>    <span class="n">ntt</span><span class="p">(</span><span class="n">a</span><span class="p">,</span><span class="n">k</span><span class="p">,</span><span class="mi">1</span><span class="p">);</span><span class="n">ntt</span><span class="p">(</span><span class="n">b</span><span class="p">,</span><span class="n">k</span><span class="p">,</span><span class="mi">1</span><span class="p">);</span><span class="k">for</span><span class="p">(</span><span class="kt">int</span> <span class="n">i</span><span class="o">=</span><span class="mi">0</span><span class="p">;</span><span class="n">i</span><span class="o">&lt;</span><span class="p">(</span><span class="mi">1</span><span class="o">&lt;&lt;</span><span class="n">k</span><span class="p">);</span><span class="n">i</span><span class="o">++</span><span class="p">)</span><span class="n">a</span><span class="p">[</span><span class="n">i</span><span class="p">]</span><span class="o">*=</span><span class="n">b</span><span class="p">[</span><span class="n">i</span><span class="p">];</span>
<span class="linenos" data-linenos="101 "></span>    <span class="n">ntt</span><span class="p">(</span><span class="n">a</span><span class="p">,</span><span class="n">k</span><span class="p">,</span><span class="mi">-1</span><span class="p">),</span><span class="n">a</span><span class="p">.</span><span class="n">resize</span><span class="p">(</span><span class="n">n</span><span class="p">);</span><span class="k">return</span> <span class="n">a</span><span class="p">;</span>
<span class="linenos" data-linenos="102 "></span><span class="p">}</span>
<span class="linenos" data-linenos="103 "></span><span class="kr">inline</span> <span class="n">poly</span> <span class="k">operator</span><span class="o">*</span><span class="p">(</span><span class="n">poly</span> <span class="n">a</span><span class="p">,</span><span class="n">modint</span><span class="o">&lt;</span><span class="n">mod</span><span class="o">&gt;</span> <span class="n">b</span><span class="p">){</span><span class="k">for</span><span class="p">(</span><span class="kt">int</span> <span class="n">i</span><span class="o">=</span><span class="mi">0</span><span class="p">;</span><span class="n">i</span><span class="o">&lt;</span><span class="n">a</span><span class="p">.</span><span class="n">size</span><span class="p">();</span><span class="n">i</span><span class="o">++</span><span class="p">)</span><span class="n">a</span><span class="p">[</span><span class="n">i</span><span class="p">]</span><span class="o">*=</span><span class="n">b</span><span class="p">;</span><span class="k">return</span> <span class="n">a</span><span class="p">;</span> <span class="p">}</span>
<span class="linenos" data-linenos="104 "></span><span class="kr">inline</span> <span class="n">poly</span> <span class="k">operator</span><span class="o">/</span><span class="p">(</span><span class="n">poly</span> <span class="n">a</span><span class="p">,</span><span class="n">modint</span><span class="o">&lt;</span><span class="n">mod</span><span class="o">&gt;</span> <span class="n">b</span><span class="p">){</span><span class="k">for</span><span class="p">(</span><span class="kt">int</span> <span class="n">i</span><span class="o">=</span><span class="mi">0</span><span class="p">;</span><span class="n">i</span><span class="o">&lt;</span><span class="n">a</span><span class="p">.</span><span class="n">size</span><span class="p">();</span><span class="n">i</span><span class="o">++</span><span class="p">)</span><span class="n">a</span><span class="p">[</span><span class="n">i</span><span class="p">]</span><span class="o">/=</span><span class="n">b</span><span class="p">;</span><span class="k">return</span> <span class="n">a</span><span class="p">;</span> <span class="p">}</span>
<span class="linenos" data-linenos="105 "></span><span class="kr">inline</span> <span class="n">poly</span> <span class="k">operator</span><span class="o">-</span><span class="p">(</span><span class="n">poly</span> <span class="n">a</span><span class="p">){</span><span class="k">for</span><span class="p">(</span><span class="kt">int</span> <span class="n">i</span><span class="o">=</span><span class="mi">0</span><span class="p">;</span><span class="n">i</span><span class="o">&lt;</span><span class="n">a</span><span class="p">.</span><span class="n">size</span><span class="p">();</span><span class="n">i</span><span class="o">++</span><span class="p">)</span><span class="n">a</span><span class="p">[</span><span class="n">i</span><span class="p">]</span><span class="o">=-</span><span class="n">a</span><span class="p">[</span><span class="n">i</span><span class="p">];</span><span class="k">return</span> <span class="n">a</span><span class="p">;}</span>
<span class="linenos" data-linenos="106 "></span><span class="n">poly</span> <span class="n">inv</span><span class="p">(</span><span class="n">poly</span> <span class="n">F</span><span class="p">,</span><span class="kt">int</span> <span class="n">k</span><span class="p">){</span>
<span class="linenos" data-linenos="107 "></span>    <span class="kt">int</span> <span class="n">n</span><span class="o">=</span><span class="mi">1</span><span class="o">&lt;&lt;</span><span class="n">k</span><span class="p">;</span><span class="n">F</span><span class="p">.</span><span class="n">resize</span><span class="p">(</span><span class="n">n</span><span class="p">);</span>
<span class="linenos" data-linenos="108 "></span>    <span class="k">if</span><span class="p">(</span><span class="n">n</span><span class="o">==</span><span class="mi">1</span><span class="p">){</span><span class="n">F</span><span class="p">[</span><span class="mi">0</span><span class="p">]</span><span class="o">=</span><span class="n">modint</span><span class="o">&lt;</span><span class="n">mod</span><span class="o">&gt;</span><span class="p">(</span><span class="mi">1</span><span class="p">)</span><span class="o">/</span><span class="n">F</span><span class="p">[</span><span class="mi">0</span><span class="p">];</span><span class="k">return</span> <span class="n">F</span><span class="p">;}</span>
<span class="linenos" data-linenos="109 "></span>    <span class="n">poly</span> <span class="n">G</span><span class="p">,</span><span class="n">H</span><span class="o">=</span><span class="n">inv</span><span class="p">(</span><span class="n">F</span><span class="p">,</span><span class="n">k</span><span class="mi">-1</span><span class="p">);</span>
<span class="linenos" data-linenos="110 "></span>    <span class="n">G</span><span class="p">.</span><span class="n">resize</span><span class="p">(</span><span class="n">n</span><span class="p">),</span><span class="n">H</span><span class="p">.</span><span class="n">resize</span><span class="p">(</span><span class="n">n</span><span class="o">&lt;&lt;</span><span class="mi">1</span><span class="p">),</span><span class="n">F</span><span class="p">.</span><span class="n">resize</span><span class="p">(</span><span class="n">n</span><span class="o">&lt;&lt;</span><span class="mi">1</span><span class="p">);</span>
<span class="linenos" data-linenos="111 "></span>    <span class="k">for</span><span class="p">(</span><span class="kt">int</span> <span class="n">i</span><span class="o">=</span><span class="mi">0</span><span class="p">;</span><span class="n">i</span><span class="o">&lt;</span><span class="n">n</span><span class="o">/</span><span class="mi">2</span><span class="p">;</span><span class="n">i</span><span class="o">++</span><span class="p">)</span><span class="n">G</span><span class="p">[</span><span class="n">i</span><span class="p">]</span><span class="o">=</span><span class="n">H</span><span class="p">[</span><span class="n">i</span><span class="p">]</span><span class="o">*</span><span class="mi">2</span><span class="p">;</span>
<span class="linenos" data-linenos="112 "></span>    <span class="n">init</span><span class="p">(</span><span class="n">k</span><span class="o">+</span><span class="mi">1</span><span class="p">),</span><span class="n">ntt</span><span class="p">(</span><span class="n">H</span><span class="p">,</span><span class="n">k</span><span class="o">+</span><span class="mi">1</span><span class="p">,</span><span class="mi">1</span><span class="p">),</span><span class="n">ntt</span><span class="p">(</span><span class="n">F</span><span class="p">,</span><span class="n">k</span><span class="o">+</span><span class="mi">1</span><span class="p">,</span><span class="mi">1</span><span class="p">);</span>
<span class="linenos" data-linenos="113 "></span>    <span class="k">for</span><span class="p">(</span><span class="kt">int</span> <span class="n">i</span><span class="o">=</span><span class="mi">0</span><span class="p">;</span><span class="n">i</span><span class="o">&lt;</span><span class="p">(</span><span class="n">n</span><span class="o">&lt;&lt;</span><span class="mi">1</span><span class="p">);</span><span class="n">i</span><span class="o">++</span><span class="p">)</span><span class="n">H</span><span class="p">[</span><span class="n">i</span><span class="p">]</span><span class="o">=</span><span class="n">H</span><span class="p">[</span><span class="n">i</span><span class="p">]</span><span class="o">*</span><span class="n">H</span><span class="p">[</span><span class="n">i</span><span class="p">]</span><span class="o">*</span><span class="n">F</span><span class="p">[</span><span class="n">i</span><span class="p">];</span>
<span class="linenos" data-linenos="114 "></span>    <span class="n">ntt</span><span class="p">(</span><span class="n">H</span><span class="p">,</span><span class="n">k</span><span class="o">+</span><span class="mi">1</span><span class="p">,</span><span class="mi">-1</span><span class="p">),</span><span class="n">H</span><span class="p">.</span><span class="n">resize</span><span class="p">(</span><span class="n">n</span><span class="p">);</span>
<span class="linenos" data-linenos="115 "></span>    <span class="k">for</span><span class="p">(</span><span class="kt">int</span> <span class="n">i</span><span class="o">=</span><span class="mi">0</span><span class="p">;</span><span class="n">i</span><span class="o">&lt;</span><span class="n">n</span><span class="p">;</span><span class="n">i</span><span class="o">++</span><span class="p">)</span><span class="n">G</span><span class="p">[</span><span class="n">i</span><span class="p">]</span><span class="o">-=</span><span class="n">H</span><span class="p">[</span><span class="n">i</span><span class="p">];</span><span class="k">return</span> <span class="n">G</span><span class="p">;</span>
<span class="linenos" data-linenos="116 "></span><span class="p">}</span>
<span class="linenos" data-linenos="117 "></span><span class="kr">inline</span> <span class="n">poly</span> <span class="n">inv</span><span class="p">(</span><span class="n">poly</span> <span class="n">a</span><span class="p">){</span>
<span class="linenos" data-linenos="118 "></span>    <span class="kt">int</span> <span class="n">n</span><span class="o">=</span><span class="n">a</span><span class="p">.</span><span class="n">size</span><span class="p">();</span>
<span class="linenos" data-linenos="119 "></span>    <span class="n">a</span><span class="o">=</span><span class="n">inv</span><span class="p">(</span><span class="n">a</span><span class="p">,</span><span class="n">ext</span><span class="p">(</span><span class="n">n</span><span class="p">)),</span><span class="n">a</span><span class="p">.</span><span class="n">resize</span><span class="p">(</span><span class="n">n</span><span class="p">);</span><span class="k">return</span> <span class="n">a</span><span class="p">;;</span>
<span class="linenos" data-linenos="120 "></span><span class="p">}</span>
<span class="linenos" data-linenos="121 "></span><span class="kr">inline</span> <span class="n">poly</span> <span class="n">deriv</span><span class="p">(</span><span class="n">poly</span> <span class="n">a</span><span class="p">){</span><span class="c1">//求导 </span>
<span class="linenos" data-linenos="122 "></span>    <span class="kt">int</span> <span class="n">n</span><span class="o">=</span><span class="n">a</span><span class="p">.</span><span class="n">size</span><span class="p">()</span><span class="mi">-1</span><span class="p">;</span>
<span class="linenos" data-linenos="123 "></span>    <span class="k">for</span><span class="p">(</span><span class="kt">int</span> <span class="n">i</span><span class="o">=</span><span class="mi">0</span><span class="p">;</span><span class="n">i</span><span class="o">&lt;</span><span class="n">n</span><span class="p">;</span><span class="n">i</span><span class="o">++</span><span class="p">)</span><span class="n">a</span><span class="p">[</span><span class="n">i</span><span class="p">]</span><span class="o">=</span><span class="n">a</span><span class="p">[</span><span class="n">i</span><span class="o">+</span><span class="mi">1</span><span class="p">]</span><span class="o">*</span><span class="p">(</span><span class="n">i</span><span class="o">+</span><span class="mi">1</span><span class="p">);</span>
<span class="linenos" data-linenos="124 "></span>    <span class="n">a</span><span class="p">.</span><span class="n">resize</span><span class="p">(</span><span class="n">n</span><span class="p">);</span><span class="k">return</span> <span class="n">a</span><span class="p">;</span>
<span class="linenos" data-linenos="125 "></span><span class="p">}</span>
<span class="linenos" data-linenos="126 "></span><span class="kr">inline</span> <span class="n">poly</span> <span class="n">inter</span><span class="p">(</span><span class="n">poly</span> <span class="n">a</span><span class="p">){</span><span class="c1">//求原 </span>
<span class="linenos" data-linenos="127 "></span>    <span class="kt">int</span> <span class="n">n</span><span class="o">=</span><span class="n">a</span><span class="p">.</span><span class="n">size</span><span class="p">()</span><span class="o">+</span><span class="mi">1</span><span class="p">;</span><span class="n">a</span><span class="p">.</span><span class="n">resize</span><span class="p">(</span><span class="n">n</span><span class="p">);</span>
<span class="linenos" data-linenos="128 "></span>    <span class="k">for</span><span class="p">(</span><span class="kt">int</span> <span class="n">i</span><span class="o">=</span><span class="n">n</span><span class="p">;</span><span class="n">i</span><span class="o">&gt;=</span><span class="mi">1</span><span class="p">;</span><span class="n">i</span><span class="o">--</span><span class="p">)</span><span class="n">a</span><span class="p">[</span><span class="n">i</span><span class="p">]</span><span class="o">=</span><span class="n">a</span><span class="p">[</span><span class="n">i</span><span class="mi">-1</span><span class="p">]</span><span class="o">/</span><span class="n">i</span><span class="p">;</span>
<span class="linenos" data-linenos="129 "></span>    <span class="n">a</span><span class="p">[</span><span class="mi">0</span><span class="p">]</span><span class="o">=</span><span class="mi">0</span><span class="p">;</span><span class="k">return</span> <span class="n">a</span><span class="p">;</span>
<span class="linenos" data-linenos="130 "></span><span class="p">}</span>
<span class="linenos" data-linenos="131 "></span><span class="kr">inline</span> <span class="n">poly</span> <span class="n">ln</span><span class="p">(</span><span class="n">poly</span> <span class="n">a</span><span class="p">){</span>
<span class="linenos" data-linenos="132 "></span>    <span class="kt">int</span> <span class="n">n</span><span class="o">=</span><span class="n">a</span><span class="p">.</span><span class="n">size</span><span class="p">();</span>
<span class="linenos" data-linenos="133 "></span>    <span class="n">a</span><span class="o">=</span><span class="n">inter</span><span class="p">(</span><span class="n">deriv</span><span class="p">(</span><span class="n">a</span><span class="p">)</span><span class="o">*</span><span class="n">inv</span><span class="p">(</span><span class="n">a</span><span class="p">));</span>
<span class="linenos" data-linenos="134 "></span>    <span class="n">a</span><span class="p">.</span><span class="n">resize</span><span class="p">(</span><span class="n">n</span><span class="p">);</span><span class="k">return</span> <span class="n">a</span><span class="p">;</span>
<span class="linenos" data-linenos="135 "></span><span class="p">}</span>
<span class="linenos" data-linenos="136 "></span><span class="n">poly</span> <span class="n">exp</span><span class="p">(</span><span class="n">poly</span> <span class="n">a</span><span class="p">,</span><span class="kt">int</span> <span class="n">k</span><span class="p">){</span>
<span class="linenos" data-linenos="137 "></span>    <span class="kt">int</span> <span class="n">n</span><span class="o">=</span><span class="mi">1</span><span class="o">&lt;&lt;</span><span class="n">k</span><span class="p">;</span><span class="n">a</span><span class="p">.</span><span class="n">resize</span><span class="p">(</span><span class="n">n</span><span class="p">);</span>
<span class="linenos" data-linenos="138 "></span>    <span class="k">if</span><span class="p">(</span><span class="n">n</span><span class="o">==</span><span class="mi">1</span><span class="p">)</span><span class="k">return</span> <span class="n">one</span><span class="p">();</span>
<span class="linenos" data-linenos="139 "></span>    <span class="n">poly</span> <span class="n">f0</span><span class="o">=</span><span class="n">exp</span><span class="p">(</span><span class="n">a</span><span class="p">,</span><span class="n">k</span><span class="mi">-1</span><span class="p">);</span><span class="n">f0</span><span class="p">.</span><span class="n">resize</span><span class="p">(</span><span class="n">n</span><span class="p">);</span>
<span class="linenos" data-linenos="140 "></span>    <span class="k">return</span> <span class="n">f0</span><span class="o">*</span><span class="p">(</span><span class="n">one</span><span class="p">()</span><span class="o">+</span><span class="n">a</span><span class="o">-</span><span class="n">ln</span><span class="p">(</span><span class="n">f0</span><span class="p">));</span> 
<span class="linenos" data-linenos="141 "></span><span class="p">}</span>
<span class="linenos" data-linenos="142 "></span><span class="n">poly</span> <span class="n">exp</span><span class="p">(</span><span class="n">poly</span> <span class="n">a</span><span class="p">){</span>
<span class="linenos" data-linenos="143 "></span>    <span class="kt">int</span> <span class="n">n</span><span class="o">=</span><span class="n">a</span><span class="p">.</span><span class="n">size</span><span class="p">();</span>
<span class="linenos" data-linenos="144 "></span>    <span class="n">a</span><span class="o">=</span><span class="n">exp</span><span class="p">(</span><span class="n">a</span><span class="p">,</span><span class="n">ext</span><span class="p">(</span><span class="n">n</span><span class="p">));</span><span class="n">a</span><span class="p">.</span><span class="n">resize</span><span class="p">(</span><span class="n">n</span><span class="p">);</span><span class="k">return</span> <span class="n">a</span><span class="p">;</span>
<span class="linenos" data-linenos="145 "></span><span class="p">}</span>
<span class="linenos" data-linenos="146 "></span><span class="kr">inline</span> <span class="n">poly</span> <span class="n">pow</span><span class="p">(</span><span class="n">poly</span> <span class="n">a</span><span class="p">,</span><span class="n">modint</span><span class="o">&lt;</span><span class="n">mod</span><span class="o">&gt;</span> <span class="n">k</span><span class="p">){</span><span class="c1">//保证a[0]=1 </span>
<span class="linenos" data-linenos="147 "></span>    <span class="n">a</span><span class="o">=</span><span class="n">ln</span><span class="p">(</span><span class="n">a</span><span class="p">);</span><span class="k">for</span><span class="p">(</span><span class="kt">int</span> <span class="n">i</span><span class="o">=</span><span class="mi">0</span><span class="p">;</span><span class="n">i</span><span class="o">&lt;</span><span class="n">a</span><span class="p">.</span><span class="n">size</span><span class="p">();</span><span class="n">i</span><span class="o">++</span><span class="p">)</span><span class="n">a</span><span class="p">[</span><span class="n">i</span><span class="p">]</span><span class="o">*=</span><span class="n">k</span><span class="p">.</span><span class="n">x</span><span class="p">;</span>
<span class="linenos" data-linenos="148 "></span>    <span class="k">return</span> <span class="nf">exp</span><span class="p">(</span><span class="n">a</span><span class="p">);</span>
<span class="linenos" data-linenos="149 "></span><span class="p">}</span>
<span class="linenos" data-linenos="150 "></span><span class="n">poly</span> <span class="n">divx</span><span class="p">(</span><span class="n">poly</span> <span class="n">f</span><span class="p">){</span>
<span class="linenos" data-linenos="151 "></span>    <span class="k">if</span><span class="p">(</span><span class="n">f</span><span class="p">[</span><span class="mi">0</span><span class="p">]</span><span class="o">!=</span><span class="mi">0</span><span class="p">)</span><span class="n">exit</span><span class="p">(</span><span class="mi">-1</span><span class="p">);</span>
<span class="linenos" data-linenos="152 "></span>    <span class="k">for</span><span class="p">(</span><span class="kt">int</span> <span class="n">i</span><span class="o">=</span><span class="mi">0</span><span class="p">;</span><span class="n">i</span><span class="o">&lt;</span><span class="n">f</span><span class="p">.</span><span class="n">size</span><span class="p">()</span><span class="mi">-2</span><span class="p">;</span><span class="n">i</span><span class="o">++</span><span class="p">)</span>
<span class="linenos" data-linenos="153 "></span>        <span class="n">f</span><span class="p">[</span><span class="n">i</span><span class="p">]</span><span class="o">=</span><span class="n">f</span><span class="p">[</span><span class="n">i</span><span class="o">+</span><span class="mi">1</span><span class="p">];</span>
<span class="linenos" data-linenos="154 "></span>    <span class="n">f</span><span class="p">.</span><span class="n">resize</span><span class="p">(</span><span class="n">f</span><span class="p">.</span><span class="n">size</span><span class="p">()</span><span class="mi">-1</span><span class="p">);</span>
<span class="linenos" data-linenos="155 "></span>    <span class="k">return</span> <span class="n">f</span><span class="p">;</span>
<span class="linenos" data-linenos="156 "></span><span class="p">}</span>
<span class="linenos" data-linenos="157 "></span><span class="n">poly</span> <span class="n">mulx</span><span class="p">(</span><span class="n">poly</span> <span class="n">f</span><span class="p">){</span>
<span class="linenos" data-linenos="158 "></span>    <span class="kt">int</span> <span class="n">n</span><span class="o">=</span><span class="n">f</span><span class="p">.</span><span class="n">size</span><span class="p">();</span><span class="n">f</span><span class="p">.</span><span class="n">resize</span><span class="p">(</span><span class="n">n</span><span class="o">+</span><span class="mi">1</span><span class="p">);</span>
<span class="linenos" data-linenos="159 "></span>    <span class="k">for</span><span class="p">(</span><span class="kt">int</span> <span class="n">i</span><span class="o">=</span><span class="n">n</span><span class="p">;</span><span class="n">i</span><span class="p">;</span><span class="n">i</span><span class="o">--</span><span class="p">)</span>
<span class="linenos" data-linenos="160 "></span>        <span class="n">f</span><span class="p">[</span><span class="n">i</span><span class="p">]</span><span class="o">=</span><span class="n">f</span><span class="p">[</span><span class="n">i</span><span class="mi">-1</span><span class="p">];</span>
<span class="linenos" data-linenos="161 "></span>    <span class="n">f</span><span class="p">[</span><span class="mi">0</span><span class="p">]</span><span class="o">=</span><span class="mi">0</span><span class="p">;</span><span class="k">return</span> <span class="n">f</span><span class="p">;</span>
<span class="linenos" data-linenos="162 "></span><span class="p">}</span>
<span class="linenos" data-linenos="163 "></span><span class="k">typedef</span> <span class="n">modint</span><span class="o">&lt;</span><span class="n">mod</span><span class="o">&gt;</span><span class="n">mint</span><span class="p">;</span>
<span class="linenos" data-linenos="164 "></span><span class="kt">int</span> <span class="n">n</span><span class="p">;</span>
<span class="linenos" data-linenos="165 "></span><span class="n">mint</span> <span class="n">fac</span><span class="p">[</span><span class="n">N</span><span class="p">],</span><span class="n">ifac</span><span class="p">[</span><span class="n">N</span><span class="p">];</span>
<span class="linenos" data-linenos="166 "></span><span class="n">mint</span> <span class="n">f</span><span class="p">[</span><span class="n">N</span><span class="p">];</span> 
<span class="linenos" data-linenos="167 "></span><span class="kt">signed</span> <span class="nf">main</span><span class="p">(){</span>
<span class="linenos" data-linenos="168 "></span>    <span class="n">fac</span><span class="p">[</span><span class="mi">0</span><span class="p">]</span><span class="o">=</span><span class="mi">1</span><span class="p">;</span><span class="k">for</span><span class="p">(</span><span class="kt">int</span> <span class="n">i</span><span class="o">=</span><span class="mi">1</span><span class="p">;</span><span class="n">i</span><span class="o">&lt;</span><span class="n">N</span><span class="p">;</span><span class="n">i</span><span class="o">++</span><span class="p">)</span><span class="n">fac</span><span class="p">[</span><span class="n">i</span><span class="p">]</span><span class="o">=</span><span class="n">fac</span><span class="p">[</span><span class="n">i</span><span class="mi">-1</span><span class="p">]</span><span class="o">*</span><span class="n">i</span><span class="p">;</span>
<span class="linenos" data-linenos="169 "></span>    <span class="n">ifac</span><span class="p">[</span><span class="n">N</span><span class="mi">-1</span><span class="p">]</span><span class="o">=</span><span class="n">mint</span><span class="p">(</span><span class="mi">1</span><span class="p">)</span><span class="o">/</span><span class="n">fac</span><span class="p">[</span><span class="n">N</span><span class="mi">-1</span><span class="p">];</span><span class="k">for</span><span class="p">(</span><span class="kt">int</span> <span class="n">i</span><span class="o">=</span><span class="n">N</span><span class="mi">-1</span><span class="p">;</span><span class="n">i</span><span class="p">;</span><span class="n">i</span><span class="o">--</span><span class="p">)</span><span class="n">ifac</span><span class="p">[</span><span class="n">i</span><span class="mi">-1</span><span class="p">]</span><span class="o">=</span><span class="n">ifac</span><span class="p">[</span><span class="n">i</span><span class="p">]</span><span class="o">*</span><span class="n">i</span><span class="p">;</span>
<span class="linenos" data-linenos="170 "></span>    <span class="n">scanf</span><span class="p">(</span><span class="s">&quot;%d&quot;</span><span class="p">,</span><span class="o">&amp;</span><span class="n">n</span><span class="p">);</span>
<span class="linenos" data-linenos="171 "></span>    <span class="c1">//n=100000;</span>
<span class="linenos" data-linenos="172 "></span>    <span class="n">poly</span> <span class="n">F</span><span class="p">,</span><span class="n">P</span><span class="p">,</span><span class="n">H</span><span class="p">;</span>
<span class="linenos" data-linenos="173 "></span>    <span class="n">F</span><span class="p">.</span><span class="n">resize</span><span class="p">(</span><span class="n">n</span><span class="o">+</span><span class="mi">5</span><span class="p">);</span>
<span class="linenos" data-linenos="174 "></span>    <span class="n">P</span><span class="p">.</span><span class="n">resize</span><span class="p">(</span><span class="n">n</span><span class="o">+</span><span class="mi">5</span><span class="p">);</span>
<span class="linenos" data-linenos="175 "></span>    <span class="n">H</span><span class="p">.</span><span class="n">resize</span><span class="p">(</span><span class="n">n</span><span class="o">+</span><span class="mi">5</span><span class="p">);</span>
<span class="linenos" data-linenos="176 "></span>
<span class="linenos" data-linenos="177 "></span>    <span class="k">for</span><span class="p">(</span><span class="kt">int</span> <span class="n">i</span><span class="o">=</span><span class="mi">1</span><span class="p">;</span><span class="n">i</span><span class="o">&lt;</span><span class="n">F</span><span class="p">.</span><span class="n">size</span><span class="p">();</span><span class="n">i</span><span class="o">++</span><span class="p">)</span><span class="n">F</span><span class="p">[</span><span class="n">i</span><span class="p">]</span><span class="o">=</span><span class="n">ifac</span><span class="p">[</span><span class="n">i</span><span class="p">];</span>
<span class="linenos" data-linenos="178 "></span>    <span class="n">F</span><span class="o">=</span><span class="n">divx</span><span class="p">(</span><span class="n">F</span><span class="p">);</span>
<span class="linenos" data-linenos="179 "></span>    <span class="n">F</span><span class="o">=-</span><span class="n">F</span><span class="p">;</span><span class="n">F</span><span class="p">[</span><span class="mi">0</span><span class="p">]</span><span class="o">=</span><span class="n">F</span><span class="p">[</span><span class="mi">0</span><span class="p">]</span><span class="o">+</span><span class="mi">1</span><span class="p">;</span>
<span class="linenos" data-linenos="180 "></span>    <span class="n">F</span><span class="o">=</span><span class="n">divx</span><span class="p">(</span><span class="n">F</span><span class="p">);</span>
<span class="linenos" data-linenos="181 "></span>    <span class="n">F</span><span class="o">=</span><span class="n">inv</span><span class="p">(</span><span class="n">F</span><span class="p">);</span>
<span class="linenos" data-linenos="182 "></span>    <span class="c1">//F.print();</span>
<span class="linenos" data-linenos="183 "></span>    <span class="k">for</span><span class="p">(</span><span class="kt">int</span> <span class="n">i</span><span class="o">=</span><span class="mi">1</span><span class="p">;</span><span class="n">i</span><span class="o">&lt;</span><span class="n">P</span><span class="p">.</span><span class="n">size</span><span class="p">();</span><span class="n">i</span><span class="o">++</span><span class="p">)</span><span class="k">if</span><span class="p">(</span><span class="n">i</span><span class="o">&amp;</span><span class="mi">1</span><span class="p">)</span><span class="n">P</span><span class="p">[</span><span class="n">i</span><span class="p">]</span><span class="o">=</span><span class="n">mint</span><span class="p">(</span><span class="mi">1</span><span class="p">)</span><span class="o">/</span><span class="n">i</span><span class="p">;</span><span class="k">else</span> <span class="n">P</span><span class="p">[</span><span class="n">i</span><span class="p">]</span><span class="o">=-</span><span class="n">mint</span><span class="p">(</span><span class="mi">1</span><span class="p">)</span><span class="o">/</span><span class="n">i</span><span class="p">;</span>
<span class="linenos" data-linenos="184 "></span>    <span class="c1">//P.print();</span>
<span class="linenos" data-linenos="185 "></span>    <span class="n">H</span><span class="o">=</span><span class="n">inv</span><span class="p">(</span><span class="n">divx</span><span class="p">(</span><span class="n">P</span><span class="p">));</span>
<span class="linenos" data-linenos="186 "></span>    <span class="c1">//H.print();</span>
<span class="linenos" data-linenos="187 "></span>    <span class="n">poly</span> <span class="n">KK</span><span class="o">=-</span><span class="n">H</span><span class="p">;</span><span class="n">KK</span><span class="p">[</span><span class="mi">0</span><span class="p">]</span><span class="o">++</span><span class="p">;</span><span class="n">KK</span><span class="o">=</span><span class="n">divx</span><span class="p">(</span><span class="n">KK</span><span class="p">);</span><span class="n">KK</span><span class="o">=</span><span class="n">inv</span><span class="p">(</span><span class="n">KK</span><span class="p">);</span>
<span class="linenos" data-linenos="188 "></span>    <span class="c1">//KK.print();</span>
<span class="linenos" data-linenos="189 "></span>    <span class="n">poly</span> <span class="n">tmp</span><span class="o">=</span><span class="n">pow</span><span class="p">(</span><span class="n">H</span><span class="p">,</span><span class="n">n</span><span class="o">+</span><span class="mi">1</span><span class="p">);</span>
<span class="linenos" data-linenos="190 "></span>    <span class="n">poly</span> <span class="n">tmp1</span><span class="o">=</span><span class="n">tmp</span><span class="o">*</span><span class="n">KK</span><span class="p">;</span>
<span class="linenos" data-linenos="191 "></span>    <span class="n">poly</span> <span class="n">tmp2</span><span class="o">=</span><span class="n">deriv</span><span class="p">(</span><span class="n">H</span><span class="p">)</span><span class="o">*</span><span class="n">tmp</span><span class="p">;</span>
<span class="linenos" data-linenos="192 "></span>    <span class="n">tmp2</span><span class="p">.</span><span class="n">resize</span><span class="p">(</span><span class="n">n</span><span class="o">+</span><span class="mi">5</span><span class="p">);</span>
<span class="linenos" data-linenos="193 "></span>    <span class="n">tmp2</span><span class="o">=</span><span class="n">tmp2</span><span class="o">*</span><span class="n">KK</span><span class="p">;</span>
<span class="linenos" data-linenos="194 "></span>    <span class="n">tmp2</span><span class="p">.</span><span class="n">resize</span><span class="p">(</span><span class="n">n</span><span class="o">+</span><span class="mi">5</span><span class="p">);</span>
<span class="linenos" data-linenos="195 "></span>    <span class="n">tmp2</span><span class="o">=</span><span class="n">tmp2</span><span class="o">*</span><span class="n">KK</span><span class="p">;</span>
<span class="linenos" data-linenos="196 "></span>    <span class="k">for</span><span class="p">(</span><span class="kt">int</span> <span class="n">j</span><span class="o">=</span><span class="mi">1</span><span class="p">;</span><span class="n">j</span><span class="o">&lt;=</span><span class="n">n</span><span class="o">+</span><span class="mi">1</span><span class="p">;</span><span class="n">j</span><span class="o">++</span><span class="p">){</span>
<span class="linenos" data-linenos="197 "></span>        <span class="kt">int</span> <span class="n">m</span><span class="o">=</span><span class="n">n</span><span class="o">-</span><span class="n">j</span><span class="o">+</span><span class="mi">1</span><span class="p">;</span>
<span class="linenos" data-linenos="198 "></span>        <span class="n">f</span><span class="p">[</span><span class="n">j</span><span class="p">]</span><span class="o">=</span><span class="n">F</span><span class="p">[</span><span class="n">j</span><span class="o">+</span><span class="mi">1</span><span class="p">]</span><span class="o">-</span><span class="p">(</span><span class="n">mint</span><span class="p">(</span><span class="mi">1</span><span class="p">)</span><span class="o">/</span><span class="p">(</span><span class="n">n</span><span class="o">+</span><span class="mi">1</span><span class="p">))</span><span class="o">*</span><span class="p">(</span><span class="n">tmp2</span><span class="p">[</span><span class="n">n</span><span class="o">-</span><span class="n">m</span><span class="o">+</span><span class="mi">2</span><span class="p">]</span><span class="o">+</span><span class="p">(</span><span class="n">tmp1</span><span class="p">[</span><span class="n">n</span><span class="o">-</span><span class="n">m</span><span class="o">+</span><span class="mi">2</span><span class="p">]</span><span class="o">*</span><span class="n">m</span><span class="p">));</span>
<span class="linenos" data-linenos="199 "></span>        <span class="c1">//printf(&quot;%d &quot;,f[j]);</span>
<span class="linenos" data-linenos="200 "></span>    <span class="p">}</span>
<span class="linenos" data-linenos="201 "></span>    <span class="c1">//printf(&quot;\n&quot;);</span>
<span class="linenos" data-linenos="202 "></span>    <span class="n">poly</span> <span class="n">a</span><span class="p">,</span><span class="n">b</span><span class="p">;</span><span class="n">a</span><span class="p">.</span><span class="n">resize</span><span class="p">(</span><span class="n">n</span><span class="p">);</span><span class="n">b</span><span class="p">.</span><span class="n">resize</span><span class="p">(</span><span class="n">n</span><span class="p">);</span>
<span class="linenos" data-linenos="203 "></span>    <span class="k">for</span><span class="p">(</span><span class="kt">int</span> <span class="n">j</span><span class="o">=</span><span class="mi">0</span><span class="p">;</span><span class="n">j</span><span class="o">&lt;</span><span class="n">n</span><span class="p">;</span><span class="n">j</span><span class="o">++</span><span class="p">)</span><span class="n">a</span><span class="p">[</span><span class="n">n</span><span class="o">-</span><span class="n">j</span><span class="mi">-1</span><span class="p">]</span><span class="o">=</span><span class="n">fac</span><span class="p">[</span><span class="n">j</span><span class="p">]</span><span class="o">*</span><span class="n">f</span><span class="p">[</span><span class="n">j</span><span class="p">];</span>
<span class="linenos" data-linenos="204 "></span>    <span class="k">for</span><span class="p">(</span><span class="kt">int</span> <span class="n">j</span><span class="o">=</span><span class="mi">0</span><span class="p">;</span><span class="n">j</span><span class="o">&lt;</span><span class="n">n</span><span class="p">;</span><span class="n">j</span><span class="o">++</span><span class="p">)</span><span class="k">if</span><span class="p">(</span><span class="n">j</span><span class="o">&amp;</span><span class="mi">1</span><span class="p">)</span><span class="n">b</span><span class="p">[</span><span class="n">j</span><span class="p">]</span><span class="o">=-</span><span class="n">ifac</span><span class="p">[</span><span class="n">j</span><span class="p">];</span><span class="k">else</span> <span class="n">b</span><span class="p">[</span><span class="n">j</span><span class="p">]</span><span class="o">=</span><span class="n">ifac</span><span class="p">[</span><span class="n">j</span><span class="p">];</span>
<span class="linenos" data-linenos="205 "></span>    <span class="c1">//a.print();b.print();</span>
<span class="linenos" data-linenos="206 "></span>    <span class="n">a</span><span class="o">=</span><span class="n">a</span><span class="o">*</span><span class="n">b</span><span class="p">;</span><span class="n">a</span><span class="p">.</span><span class="n">resize</span><span class="p">(</span><span class="n">n</span><span class="p">);</span>
<span class="linenos" data-linenos="207 "></span>    <span class="c1">//return 0;</span>
<span class="linenos" data-linenos="208 "></span>    <span class="p">{</span>
<span class="linenos" data-linenos="209 "></span>        <span class="c1">//k=0</span>
<span class="linenos" data-linenos="210 "></span>        <span class="n">mint</span> <span class="n">tmp</span><span class="o">=</span><span class="mi">0</span><span class="p">;</span>
<span class="linenos" data-linenos="211 "></span>        <span class="k">for</span><span class="p">(</span><span class="kt">int</span> <span class="n">i</span><span class="o">=</span><span class="mi">1</span><span class="p">;</span><span class="n">i</span><span class="o">&lt;=</span><span class="n">n</span><span class="p">;</span><span class="n">i</span><span class="o">++</span><span class="p">)</span>
<span class="linenos" data-linenos="212 "></span>            <span class="n">tmp</span><span class="o">+=</span><span class="n">fac</span><span class="p">[</span><span class="n">n</span><span class="p">]</span><span class="o">*</span><span class="n">ifac</span><span class="p">[</span><span class="n">i</span><span class="p">];</span>
<span class="linenos" data-linenos="213 "></span>        <span class="n">out</span><span class="o">::</span><span class="n">write</span><span class="p">(</span><span class="n">tmp</span><span class="p">.</span><span class="n">x</span><span class="p">);</span><span class="n">out</span><span class="o">::</span><span class="n">putc</span><span class="p">(</span><span class="sc">&#39; &#39;</span><span class="p">);</span>
<span class="linenos" data-linenos="214 "></span>    <span class="p">}</span>
<span class="linenos" data-linenos="215 "></span>    <span class="k">for</span><span class="p">(</span><span class="kt">int</span> <span class="n">k</span><span class="o">=</span><span class="mi">1</span><span class="p">;</span><span class="n">k</span><span class="o">&lt;</span><span class="n">n</span><span class="p">;</span><span class="n">k</span><span class="o">++</span><span class="p">){</span>
<span class="linenos" data-linenos="216 "></span>        <span class="n">mint</span> <span class="n">ans</span><span class="o">=</span><span class="n">fac</span><span class="p">[</span><span class="n">n</span><span class="p">]</span><span class="o">*</span><span class="n">ifac</span><span class="p">[</span><span class="n">k</span><span class="p">];</span>
<span class="linenos" data-linenos="217 "></span>        <span class="n">ans</span><span class="o">*=</span><span class="n">a</span><span class="p">[</span><span class="n">n</span><span class="o">-</span><span class="n">k</span><span class="mi">-1</span><span class="p">];</span>
<span class="linenos" data-linenos="218 "></span>        <span class="n">out</span><span class="o">::</span><span class="n">write</span><span class="p">(</span><span class="n">ans</span><span class="p">.</span><span class="n">x</span><span class="p">);</span><span class="n">out</span><span class="o">::</span><span class="n">putc</span><span class="p">(</span><span class="sc">&#39; &#39;</span><span class="p">);</span>
<span class="linenos" data-linenos="219 "></span>    <span class="p">}</span><span class="n">out</span><span class="o">::</span><span class="n">flush</span><span class="p">();</span>
<span class="linenos" data-linenos="220 "></span>
<span class="linenos" data-linenos="221 "></span><span class="p">}</span>
</code></pre></div></p>
			</div>
			<div class="panel panel-default card" style="padding: 10px;height: 50px;font-size: 20px;">
				<a style="float: left;" href="\article\CF917D.html"><i class="fa fa-angle-double-left"></i></a><a style="float: right;" href="\article\la-fan.html"><i class="fa fa-angle-double-right"></i></a>
			</div>
			<div class="panel panel-default card" style="padding: 10px;font-size: 20px;" id="vcomments">
				
			</div>
			<script>
				new Valine({
					el: '#vcomments',
					appId: 'PAlFUPg0pQVTFTEo8gCB4BCf-gzGzoHsz',
					appKey: 'U38ejnLUiizJ6vLyp6ql4hRq',
					path: window.location.pathname
				})
			</script>
		</div>
		<div class="col-md-3">
				<div class="panel panel-default card">
				<div class="panel-heading">
					<h3 class="panel-title">
						<i class="fa fa-info"></i>&emsp;
						<strong>文章信息</strong>
					</h3>
				</div>
                <div style="margin: 10px;">
                    <div style="margin-top: 8px;display: flex;"> 
    <span style="flex: 1 0 auto;margin-right: 6px;">标题</span>
    <span><font style="font-weight: bold">题解 CF1349F2 【Slime and Sequences (Hard Version)】</font></span>
	</div><div style="margin-top: 8px;display: flex;"> 
    <span style="flex: 1 0 auto;margin-right: 6px;">日期</span>
    <span>2021-03-12 23:48:36</span>
	</div>
                </div>
				</div>
				<div class="panel panel-default card">
				<div class="panel-heading">
					<h3 class="panel-title">
						<i class="fa fa-tag"></i>&emsp;
						<strong>标签</strong>
					</h3>
				</div>
				<div style="margin: 10px;">
					<a href="/tags/2021/" class="tag"><span  style="background-color: rgb(52, 152, 219);">2021</span></a>&nbsp;<a href="/tags/二项式反演/" class="tag"><span  style="background-color: rgb(231, 76, 60);">二项式反演</span></a>&nbsp;<a href="/tags/拉格朗日反演/" class="tag"><span  style="background-color: rgb(231, 76, 60);">拉格朗日反演</span></a>&nbsp;<a href="/tags/生成函数/" class="tag"><span  style="background-color: rgb(231, 76, 60);">生成函数</span></a>&nbsp;<a href="/tags/题解/" class="tag"><span  style="background-color: rgb(82, 196, 26);">题解</span></a>
				</div>
				</div>
				
			<div class="panel panel-default card">
					<div class="panel-heading">
						<h3 class="panel-title">
							<i class="fa fa-user-circle-o"></i>&emsp;
							<strong>caijicjl</strong>
						</h3>
					</div>
					<div style="width: 60%;display: inline-block;padding-top: 10px;">
						<ul class="propertyLinks" style="list-style-type: none;">
							<li>
								<img style="vertical-align:middle;position:relative;top:-2px" src="/img/rating-16x16.png">
								Rating:&nbsp;
								<span style="font-weight:bold;color: gray ">312</span>
							</li>
							<li>
								<img style="vertical-align:middle;position:relative;top:-2px" src="/img/star_blue_16.png">
								Contribution:&nbsp;
								<span style="color:gray;font-weight:bold;">0</span>
							</li>
						</ul>
						<ul class="nav-links">
							<li><a href="/settings/">Settings</a></li>
							<li><a href="/archives/">Blog</a></li>
							<li><a href="/teams">Teams</a></li>
							<li><a href="/submissions/dingdingsb">Submissions</a></li>
							<li><a href="/usertalk">Talks</a></li>
							<li><a href="/contests/with/dingdingsb">Contests</a></li>
						</ul>
					</div>
					<div style="display:inline-block;vertical-align: top;margin: 10px;text-align: center;">
						<div style="height:50px;width:50px"><img src="/img/avatar.png"/></div>
						<div><a href="https://www.luogu.com.cn/user/174304" style="font-weight:bold;color:gray">caijicjl</a></div>
					</div>
				</div>
		<div class="panel panel-default card">
				<div class="panel-heading">
					<h3 class="panel-title">
						<i class="fa fa-external-link"></i>&emsp;
						<strong>画中画</strong>
					</h3>
				</div>
				<div style="width:100%;margin:10px">
				<input type="text" id="url"/>
				<input value="创建" type="button" onclick="creat('kk')" /> 
				</div>
		</div>
		<script src="/js/hitokoto.js"></script>
							

				
				<span id="kk"></span>
				<div  id="myScrollspy" class="card" style="width: 100%;"  data-spy="affix">
					<script src="/js/make_toc.js"></script>
				</div>
		</div>
	</div>
 </div>
</body>
</html>
